1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
The breadth first traversal, the processing proceeds horizontally from the root
to all its children, then to its children’s children and so forth until all nodes have
been processed.
In the preorder traversal, the root node, is processed first, followed by the left
subtree, and then the right subtree.
In the inorder traversal processes the left subtree first, then the root, and finally
the right subtree.
In the postorder traversal it processes the root node after (post) the left and
right subtrees have been processed
A. Full binary tree of height 3
B. Complete binary tree
1 1
B.
2 3
2 3
4 5 6
Basic terminology:
A. B.
A A
B B
C
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) C
Page ‐ 182 ‐
4