Explain Tree Terminology ?


Tree : A Tree is a non linear data structure which organised elements in hierarchical representation.  That means trees data structure store data values in non contagious memory locations with parent child relationship between them. One of the element is identified as root node and other elements are divided in to subgroups of root which are called Child's. Tree is a collection of nodes. Each node contains data and object references to store child address.


tree


Tree terminology :

Node : node stands for an item of data and branches to other items.
Ex : A to S are all nodes.

Root : A tree is a collection of nodes and one of the element is root node . This is beginning or starting of tree data structure.
Ex : A is the root node.

Parent : parent is a node that contains next level of nodes. Root is one of the parent.

Child : child is a node in tree data structure which is called next level node of parent. A child may contain some other Child's and acts as parent.

Leaf Node : A node which has no further child nodes is called Leaf Node
Ex : N , O , P , Q , R , S  are the leaf nodes.

Hight or Depth : The number of levels of a tree is called higher or depth of a tree  The height of above tree is 4.

Degree of a tree or node : The degree of a node is the number of subtrees it has.
Ex : degree of D is 3 and Degree of B is 4.

The degree of tree is the maximum degree of any of its node.
Ex : Degree of above tree is 4.

Siblings : The childs of same parent are called siblings.
Ex : siblings of A are B, C and D.


Related

Data Structures 976142106976980247

Post a Comment

emo-but-icon
:noprob:
:smile:
:shy:
:trope:
:sneered:
:happy:
:escort:
:rapt:
:love:
:heart:
:angry:
:hate:
:sad:
:sigh:
:disappointed:
:cry:
:fear:
:surprise:
:unbelieve:
:shit:
:like:
:dislike:
:clap:
:cuff:
:fist:
:ok:
:file:
:link:
:place:
:contact:

item