| Description |
The tree can be traversed by deciding on a sequence to visit each node. There are three traversal algorithms: in-order traversal, pre-order traversal and post-order traversal.\n<b>In-order traversal</b> visits the nodes from the left, the root node and the right\n<b>Pre-order traversal</b> visits the nodes from the root node, the left and the right\n<b>Post-order traversal</b> visits the nodes from the left, the right and the root node.\nIn this challenge, we construct an post-order traversal algorithm. |