Hey Guys , whats do u think the to solve the problem ?
my thinking to use recursion or stack , i tried but i think its not correct
& has lot of bugs ,, let me know some modification or your pseudo code ?
Tree will be like
1
/ | \
2 3 4
/ / \
5 6 7
/ \
8 9
out put will be 1st reverse the tree e.g. 2 points to 1 , 2 points to 2 ,
8 poinst to 5 and so on for each node , without modifying the tree and
then return list containing leaf node
as OutPut Head-> 8->3->6->9->NULL
Thanks
Shashank
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/4qz1vHbZq_kJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
