You are currently browsing the tag archive for the ‘Tree’ tag.
Knowing the terminology for a data structure like tree is must ,the following terms are commonly encountered while dealing with the data structure tree:-
DEFINITION :- A Tree ‘t’ is a finite non-empty set of elements,one of these elements is called Root,and the remaining elements if any are partitioned into trees,which are called the subtrees of tree ‘t’.
The difference between a linear list and a tree is that the linear list is used for serial ordered data and the trees are used for heirarchically ordered data.
