Hi, Yes.
Regards, Aman. On Sun, Dec 11, 2011 at 12:54 PM, atul anand <[email protected]>wrote: > by zig-zag order means level order traversal ??? > > On Sun, Dec 11, 2011 at 6:22 AM, AMAN AGARWAL <[email protected]>wrote: > >> Hi, >> >> Given a tree, in addition to the left and right pointer, it has a third >> pointer, that is set to NULL. >> Set the third pointer to a node, which will be the successor of the >> current node, when the tree is traversed in the zig-zag order. In other >> words, if we traverse the tree using this third pointer alone, then we will >> be traversing the tree in the zig-zag order. >> >> Regards, >> Aman >> >> -- >> AMAN AGARWAL >> "Success is not final, Failure is not fatal: It is the courage to >> continue that counts!" >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- AMAN AGARWAL "Success is not final, Failure is not fatal: It is the courage to continue that counts!" -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
