Data Structure TREE Definitions And Terminology | letsbug

1. What is tree?

    - A Tree is  a finite set of one or more nodes such that :

1. There is a specially designated node called the root.
2.  Remaining nodes are partitioned into (n >= 0) disjoint sets T1, T2, ..., Tn where each of these sets is a tree. Each T1, T2, T3 .... Tn are called sbu trees of the root.

2. Leaf Node

    - In a tree data structure, the node which does not have a child is called as Leaf Node.

3. Height of tree

    - In a tree data structure , the total number of edges from leaf node to a particular node in the longest path is called as height of the Node. In a tree, height of the root node is said to be height of the tree.

4.  Depth of tree

    - In a tree data structure, the total number of edges from root node to a particular node is called as DEPTH of that Node. In a tree, the total number of edges from root node a to a leaf node in the longest path is said to be Depth of the tree.

5.  Node 

    - In tree data structure, every individual element is called as Node. Node in a tree data structure stores the actual data of the particular element and link to next element in hierarchical structure. 

6.  Root Node

    - In a tree data structure, the first node is called as Root Node, a root node is special node which doesn't have a parent node. Every tree must have a root node. We can that the root node is the origin of the tree data structure. In any tree, the must be only one root node.

7.  Parent Node

    - In a tree data structure, the node which is a predecessor of any node is called as Parent Node. In simple words, the node which has a branch from it to any other node is called a Parent node.

8.  Child Node

    - In a tree data structure, the node which is descendant of any nodes is called as Child Node. In simple words, the node which has link from its parent node is called as child node.

9.  Siblings

    - In a tree data structure, nodes which belong to same Parent are called as Siblings. In simple words, the nodes with the same parent are called Sibling nodes.

10.  Degree of a Node

    - In a tree data structure, the total number of children of a node is called as Degree of that Node. 

11.  Degree of a Tree

    - The degree of a tree is a maximum degree of the nodes in the tree. In simple words, the highest degree of a node among all the nodes in a tree is called as Degree of tree.

12.  Level of Node

    - In a tree data structure, the root node is said to be at  Level 0 and the children of root node are a t Level 1 and the children of the nodes which are at Level 1 will be at Level 2 and so on... . In simple words, in a tree each step from top to bottom is called as a Level and the level count starts with ' 0 ' and incremented by one at each level.

    The level of node = Level of its parent + 1. The nodes with the same level number are said to the same generation.