1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
ADVANTAGES:‐
This representation is very efficient when
i. The tree is complete
ii. The structure of the tree will notbe modified
ALGORITHM:‐
Binary tree : an array implementation
STEP 1:‐root is A[1]
STEP 2:‐for element A[i]
Left child is in position A[2i]
Right child is in position A[2i+1]
STEP 3:‐parent is in A[i/2]
LINKED BINARY TREE IMPLEMENTATION:‐
Children
A non‐empty binary tree consists of a root and two children which are
binary trees once again. Since the definition of this data structure is
recursive,an appropriate rep. could be self‐referential structure. Each node
of a tree is represented by a structure.each node contains two links to the
same structure:‐left and right. If tree is NULL then the tree is empty
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 191 ‐