CareerCup

traverse(s)
{
if(s) {
preorder_queue.add(s);
traverse(s->left);
inorder_queue.add(s);
traverse(s->right);
postorder_queue(s);
}
}

Really awesome algo .....Hats off to Cougar .......

awesome algo

private void traverse(Node h)
{
if (h == null) return;
h.item.visit();
traverse(h.l);
traverse(h.r);
}
void trav()
{ traverse(root); }

By default the code implements a preorder traversal; if we put the method h.item.visit() between the recursive calls, we have an inorder traversal; and if we put it after the recursive calls, we have a postorder traversal.

first algo brilliant algo

@Cougar_CS
You rock buddy! Awesome algorithm. Thanks a lot.

@Cougar Reallyyyy awesome...

Salute to the hero Cougar_CS !!!!!!!!!!!!!!!!!!!!!!!!!

sexy soln mahn....!!

Really Man , How did u think about this algo .. Bow to Cougar_CS

ssalute>>

are you guys serious,a fifth grader can think of such a naive solution.