if given node has right subtree then its inorder successor will be left most child of given node's right child. if given node does not have right child the its successor will be its parent
On Fri, Aug 12, 2011 at 11:28 AM, Priyanka Goel < priyankatheinvinci...@gmail.com> wrote: > How to find the in-order successor of a given node in a binary search tree > where each node has a link to its parent. pl explain logic to solve it.. > ( Pl dnt give solution of doing in order traversal and storing it in > array.) > > > -- > 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. > -- **With Regards Deoki Nandan Vishwakarma * * -- 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.
