C A L LF O RP A P E R S
===
The 2009 International Conference on
Software Engineering Research and Practice
(SERP'09)
Date and Location: July 13-16, 2009, Las Vegas, USA
Hmm, it is strange that you are discusing such a basic thing. You should not
post your homework here, but maybe some research problems.
This is so easy stuff, that many people may make mistake when explaining it.
But if node has right child, then the successor is minimum of that subtree.
But if it
This would be the case of binary heaps, not binary search trees.
And also if a given node X that does not have any right child, may have a
successor, consider the minimum element of a given binary search tree T,
that would be the leftmost node in the tree T, it is a leaf and thus it does
not have
If it is a binary tree follow this.. * Right shift of the node(in
number) gives you the left child of that node
* Add binary 1 to the above result to get right child
* To find node from a child do right shift
On 2/10/09, praba garan wrote:
> how to find the successor of an element in a tree ??
>
