Home.... | log in.... | Pub my question! | Sign-up....
Java-index >> Other Topics >> Algorithms

looking for a node in a BST

How would I find the GREATEST node to the LEFT of a particular node? (this is part of a larger question, "how do I delete a node?", but I think if I get the smaller question answered I can figure it out.)
[218 byte] By [djfkdljflksdja] at [2007-10-2 16:13:05]
«« WebLogic Server 6.1 Transaction Time out Transaction
»» deploying applet in tomcat
# 1

You can delete a node from a BST by searching the node with the key you want to delete. If you find the node:

1. if the left child or right child is empty you have to replace the node with the child node not empty

2. if both childs are not empty you have to replace the node element with the minimum of the right child

Hope this help,

Andrea.

acerisaraa at 2007-7-13 17:00:02 > top of Java-index,Other Topics,Algorithms...
# 2
The greatest node to the left of the current node can be found by going first left from the node, then going right until you can't go right any more. That is the predecessor of the current node.
Alethiographera at 2007-7-13 17:00:02 > top of Java-index,Other Topics,Algorithms...
Other Topics
Algorithms

Other Topics New Topic

Other Topics Hot Topic

Other Topics

All Classified