| |
| The Lair Data Structures Main |
|
Topics:
Stack
More to Come!
|
|
EXAMPLES:
|
|
TREE:
DEFINITION:
- A tree is a data structure where data is represented in a non-sequential way. Each node of a data has a two branches where each branch contains a node which may have several sub-trees. The nodes at the end of the tree are known as leaves and don't have branches. The first node in a tree is called the root. A node in the left branch is known as a left child and a node on the right branch is known as a right child. The top node of a right or left child is know as a parent. A binary tree is one in which each node can only have a max of two branches. A binary search tree is a tree in which each node is greater than the other nodes of its sub-trees.
USEFUL TERMS:
TYPES OF TREES:
|
