PostOrder

Tree is iterated by using `Post-order Traversal Algorithm" In post-order traversal, we starting from most left child. First visit all children of parent, then parent.

E.g.
1
/ | \
/ | \
2 3 4
/ \ / | \
5 6 7 8 9
/ / | \
10 11 12 13

Output: 10 5 11 12 13 6 2 3 7 8 9 4 1

Properties

Link copied to clipboard
Link copied to clipboard