BINARY SEARCH TREES - Introduction to Java Programming: Comprehensive Version - page 947

23 printTree(tree);
24 }
25
26 public static void printTree(BST tree) {
27 // Traverse tree
28 System.out.print( "Inorder (sorted): " );
29 tree.inorder();
30 System.out.print( "\nPostorder: " );
31 tree.postorder();
32 System.out.print( "\nPreorder: " );
33 tree.preorder();
34 System.out.print( "\nThe number of nodes is " + tree.getSize());
35 System.out.println();
36 }
37 }

Inorder (sorted): Adam Daniel George Jones Michael Peter Tom
Postorder: Daniel Adam Jones Peter Tom Michael George
Preorder: George Adam Daniel Michael Jones Tom Peter
The number of nodes is 7

After delete George:
Inorder (sorted): Adam Daniel Jones Michael Peter Tom
Postorder: Adam Jones Peter Tom Michael Daniel
Preorder: Daniel Adam Michael Jones Tom Peter
The number of nodes is 6

After delete Adam:
Inorder (sorted): Daniel Jones Michael Peter Tom
Postorder: Jones Peter Tom Michael Daniel
Preorder: Daniel Michael Jones Tom Peter
The number of nodes is 5

After delete Michael:
Inorder (sorted): Daniel Jones Peter Tom
Postorder: Peter Tom Jones Daniel
Preorder: Daniel Jones Tom Peter
The number of nodes is 4

Figures 25.14-25.16 show how the tree evolves as the elements are deleted from it.

Delete this
node

George Daniel

Adam Michael Adam Michael

Daniel Jones To m Jones To m

Peter Peter

(a) Deleting George (b) After George is deleted

F IGURE 25.14

Deleting George falls into Case 2.