1) suppose node1 is at level = 4 of the tree and node2 is at level = 3 of the tree
if you do inorder traversal from node1 i.e calling function inorder(node1); now it will search form level 4 to the max depth of the tree it will never reach node2 because it is at level = 3. 2) suppose root of the tree is X node1 lies of the left subtree of the root and node2 lies on the right subtree of the root. now after saving address of node1 and node2 , you start inorder traversal at node1 or at node2. suppose if you call inorder(node1); it will search node2 in the left subtree of the root X...taking node2 as a root of the traversal , but node2 lies on the right subtree of root X. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. 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.