R. Clayton (rclayton@monmouth.edu)
Fri, 11 Feb 2000 11:22:53 -0500 (EST)
Consider an arbitrary tree of height h if we want to convert it into a
tree with the minimum possible height, we will need to reorganize the
connections between the nodes.
I agree.
Doing so, in general, will cause the successor and/or the predecessor of a
given node to change.
I disagree. predecessor() and successor(), although they operate on tree
nodes, are defined with respect to key values.
It's true that the relatives of a node in a re-organized tree may be different
from what they were in the original tree, but the successor and predecessor of
that node, in terms of key value, remains the same as they were in the original
tree.
This archive was generated by hypermail 2.0b3 on Wed Apr 26 2000 - 09:35:05 EDT