Tree

A tree is a non-linear data structure in which items are arranged in a sorted sequence, it is used to represent hierarchical relationship existing amongst several data items.

The graph theoretic definition of tree is it is a finite set of one or more data items (nodes) such that

1.      There is a special data items called the root of the tree.

2.      And its remaining data items are partitioned into number of mutually exclusive (i.e. disjoint) subsets each of which is itself a tree. Any they are called sub trees.

Tree Terminology

There are number of terms associated with the trees which are listed below:

1. Root                                              

2. Node                                             

3. Degree of a node

4 degree of a tree                             

5 Terminal node (s)                         

6  Non-terminal node (s)

7. Siblings

8. Level                                             

9. Edge

10. Path                                              

11. Depth                                            

12. Forest.

Data Structure & Algorithms Assignment Help, Live Experts 

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.