|
|
|
Post-order Tree Traversal Algorithm
|
To traverse a non-empty binary tree in postorder, perform the following operations recursively at each node, starting with the root node:
1. Traverse the left subtree.
2. Traverse the right subtree.
3. Visit the node.
created by syam1224 on 2008-05-11 05:10:40
|
|
|
|
|
