Title Description Participants Textbook

Transcription

1 Podcast Ch18c Title: BST delete operation Description: Deleting a leaf; deleting a node with one nonnull child; deleting a node with two nonnull children Participants: Barry Kurtz (instructor); John Helfert and Tobie Williams (students) Textbook: Data Structures for Java; William H. Ford and William R. Topp

2 Deleting a Node The private method removenode() erases a node from the tree by finding a replacement node somewhere else in the tree and using it as a substitute for the deleted node. Choose the node so that, when it takes the place of the deleted node, its value maintains the structure of the tree. Subtrees for the deleted node and the replacement node must be reconnected in such a way that the new tree maintains search tree ordering.

3 Deleting a Node (continued) Notation: dnode identifies the deleted node D. pnode, identifies the parent P of the deleted node. When pnode is null, we are deleting the root. The removenode() method sets out to find a replacement node R with reference rnode. The algorithm for finding a replacement node considers two cases that depend on the number of children attached to node D.

4 Deleted Node has Empty Subtree The other child becomes the replacement node R. If the deleted node is a leaf node, it has two null children and the other node R is null.

5 Deleted Node has an Empty Subtree (continued)

6 Deleted Node has Empty Subtree (cont) The algorithm must handle two special cases, one in which the deleted node is a leaf node and the other in which the deleted node is the root.

7 removenode() (one null child) private void removenode(stnode<t> dnode){ if (dnode == null) return; // dnode = reference to node D that is deleted // pnode = reference to parent P of node D // rnode = reference to node R that replaces D STNode<T> pnode, rnode; // assign pnode as a reference to P pnode = dnode.parent; // if D has a null child, the // replacement node is the other child if (dnode.left == null dnode.right == null){ if (dnode.right == null) rnode = dnode.left; else rnode = dnode.right;

8 removenode() (one null child) } if (rnode!= null) // the parent of R is now the parent of D rnode.parent = pnode; // deleting the root node; assign new root if (pnode == null) root = rnode; // attach R to the correct branch of P else if (((Comparable<T>)dNode.nodeValue). compareto(pnode.nodevalue) < 0) pnode.left = rnode; else pnode.right = rnode; }...

9 Deleted Node has Two Nonnull Children A node with two children has some elements in its subtrees that are less than and some elements that are greater than its value. Find a replacement node that maintains the correct ordering among the items. Rather than removing the deleted node, update its value with that of the replacement node. Splice the replacement node out of the tree.

10 Deleted Node has Two Nonnull Children (continued) Select R as the node with the smallest value that is greater than the value of the deleted node. R is the leftmost node in the right subtree of D.

11 Deleted Node has Two Nonnull Children (continued) Move to the right child of D and then far-left to the replacement node R, maintaining a reference, PofR, to the parent of R. Splice out R from the tree

12 removenode() (two nonnull children) public void removenode(stnode<t> dnode) { if (dnode.left == null dnode.right == null) {... } // deleted node has two nonnull children else { // pofrnode is reference to parent of // replacement node STNode<T> pofrnode = dnode; // first possible replacement is right // child of D; the reference to PofR, // pofrnode, is the deleted node rnode = dnode.right; pofrnode = dnode;

13 removenode() (two nonnull children continued) } } // descend down path of left children, keeping // a record of the current node and its parent; // stop at the replacement node while(rnode.left!= null) { pofrnode = rnode; rnode = rnode.left; }...

14 removenode() (two nonnull children continued) Complete the process by copying the value of the replacement node to D and then connect the right subtree of R to the tree. If PofR is the deleted node, then connect the right subtree of R as the rightchild of D; otherwise connect the right child of R as the left child of PofR. Assign the parent of a nonnull right subtree of R to be pofrnode, the parent of R.

15 removenode() (two nonnull children concluded) // copy the value in R to D dnode.nodevalue = rnode.nodevalue; if (pofrnode == dnode) dnode.right = rnode.right; else pofrnode.left = rnode.right; // the parent of the right child of R // becomes the parent of R if (rnode.right!= null) rnode.right.parent = pofrnode;

16 The method remove() // if item is in the tree, remove it // and return true; otherwise, return false public boolean remove(object item) { // search tree for item STNode<T> dnode = findnode(item); if (dnode == null) return false; removenode(dnode); treesize--; modcount++; } return true;

17 Given the tree Practice Problem Draw the tree after each of the following sequential deletions: 26, 33, 65, 40