In Postorder traversal sequence we first look for the left node then the right node and then the root.
Algorithm:
Code
void postOrder(tNode n)
{
if(n==null)
return;
postOrder(n.left);
postOrder(n.right);
visit(n);
}
Login to rate this answer.
Shikhar Singhal
Answered On : Jun 10th, 2013
when tree is implemented using linked list rather than 2-d array
Code
void traverse(tree head)
{
if (head.left!=NULL) traverse( head.left);
if (head.right!=NULL) traverse(head.right);
}
Login to rate this answer.