TREES

TREE TERMINOLOGY :-

                 Image result for tree in data structure


TYPES OF TREES:-

1 : BINARY TREE =Degree of any node in binary tree is (0,1,2)
2 : STRICTLY BINARY TREE(SBT)=Degree of any node in SBT is (0,,2)
3 : COMPLETE BINARY TREE(CBT)

BINARY TREE::

                                         Image result for tree in data structure cbt

A binary tree is a finite set of data item which is either empty or consists of a single item call root
and disjoint Binary are called left and right subtree 


STRICTLY BINARY TREE:

Every non terminal node in binary tree consists of non empty left and right subtree then such a tree is called strictly binary tree
degree(0 or 2)
                        

COMPLETE BINARY TREE :

1: Degree is (0,2)
2: All terminal node are at same level