i.
Post-order
Traversal
·
In this traversal
method, the root node is visited last, hence the name.
·
First we traverse the left sub tree, then the
right sub tree and finally the root node.
·
We start from A, and following
pre-order traversal, we first visit the left subtree B.
·
B is also traversed post-order.
·
The process goes on
until all the nodes are visited.
·
The output of
post-order traversal of this tree will be −
D → E → B → F → G → C → A