1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Post‐Order Traversal: To traverse a non‐empty binary tree in postorder, perform
the following operations recursively at each node:
1. Traverse the left subtree.
2. Traverse the right subtree.
3. Visit the node.
Finally, trees can also be traversed in level‐order, where we visit every node on
a level before going to a lower level. This is also called Breadth‐first traversal
Example:
Example:
Output of Pre‐Order Traversal:
F, B, A, D, C, E, G, I, H (root, left, right)
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 195 ‐