@top coder , if its given that that you have to nodes as input , 1st find the two nodes , store their address & then do any traversal to get the path between them , inorder will good . i ams assuming you wants to print the path between two such nodes.
hope it suffices :) let me know if approach it not clear or i missed something . Thanks Shashank Mani Computer Science Birla Institute of Technology,Mesra *http://shashank7s.blogspot.com* -- 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/-/0jnGdn-_vZgJ. 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.
