Considering binary search trees(of any kind) following pseudo code will
help, a successor of a node having a right child is the minimum element in
the subtree rooted at that node's right child, and if that node does not
have any right child, then you have to find the successor that would be one
of
which tree?
On Tue, Feb 10, 2009 at 7:01 AM, praba garan wrote:
> how to find the successor of an element in a tree ??
>
> thank u
>
> >
>
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To
