We can use concept of threaded binary tree, bu we'll have to store a pointer to LEVEL Order Successor of each node.
So the problem is reduced to find the level order successor of a node. Sanju :) On Wed, Aug 31, 2011 at 9:52 AM, manish kapur <[email protected]>wrote: > i think hint is mentioned in the ques..there is an extra pointer..u can > take it as parent pointer.. > > > On Wed, Aug 31, 2011 at 10:13 PM, Abhishek Yadav < > [email protected]> wrote: > >> can we use loops or GOTO statements???? >> >> On Wed, Aug 31, 2011 at 10:03 PM, manish kapur < >> [email protected]> wrote: >> >>> Given a binary Tree and a node pointer extra in a tree. print all the >>> node level by level. You cannot use any Stack ,recursion and queue. >>> >>> -- >>> 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. >> > > -- > 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.
