Post Order Binary Tree Traverse

Design a conventional iterative algorithm to traverse a binary tree represented in two dimensional array in postorder.

Showing Answers 1 - 2 of 2 Answers

Sandhya.Kishan
Profile Answers by Sandhya.Kishan

Mar 10th, 2012
In Postorder traversal sequence we first look for the left node then the right node and then the root.
Algorithm:
Code
 

Shikhar Singhal

Jun 10th, 2013
When tree is implemented using linked list rather than 2-d array
Code
span style="color: #ff0000;">"%d",&head);


}