Trees
A Tree can be defined as finite set of data items (nodes). Tree is non-linear type of data structure in which data items are arranged or stored in a sorted sequence. Tree represent the hierarchical relationship between various elements In trees:
1. There is a special data item at the top of hierarchy called the Root of the tree
2. The remaining data items are partitioned into numbed of mutually exclusive (i.e...Disjoint) subsets each of which is itself a tree which is called the sub tree.
3. The tree always grows in length towards bottom in data structures unlike natural trees which grows upwards.
The tree structure organizes the data into branches which relate the information in genealogies this type of structure is very useful.
Types of Graphs
The graphs are classified in the following categories
1 Directed Graph
2 Non-directed Graph
3 Connected Graph
4 Non-connected
5 Simple Gragh
Trees are very flexible, versatile and powerful data structures that can be used to represent data items possessing hierarchical relationship between the grandfather and his descendants and in turns their descendants and so on.
The following topics are discussed in this chapter.
Tree: definition
Binary trees
Binary tree representations
Trees and their applications
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.
ExpertsMind.com - Trees Assignment Help, Trees Homework Help, Trees Assignment Tutors, Trees Solutions, Trees Answers, Classification or Data Structure Assignment Tutors