----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\BinarySearchTree_watkindj_BSTest\BSTest Binary Search Tree Test Program. Building the first tree with elements: 5 4 8 6 9 3 2 Building the second tree with elements: 34 12 49 -1 78 23 81 Pre-Order traversal, tree1: 5 4 3 2 8 6 9 Pre-Order traversal, tree2: 34 12 -1 23 49 78 81 In-Order traversal, tree1: 2 3 4 5 6 8 9 In-Order traversal, tree2: -1 12 23 34 49 78 81 Post-Order traversal, tree1: 2 3 4 6 9 8 5 Post-Order traversal, tree2: -1 23 12 81 78 49 34 Searching for 3 in tree1. Expecting to find 3. In tree Searching for 0 in tree1. Not expecting to find. Not in tree Searching for -1 in tree1. Expecting to find -1. In tree Searching for 0 in tree1. Not expecting to find. Not in tree Deleting the element 2 from tree1 In-Order traversal of tree1: 3 4 5 6 8 9 Deleting the element 4 from tree1 In-Order traversal of tree1: 3 5 6 8 9 Deleting the element 8 from tree1 In-Order traversal of tree1: 3 5 6 9 Deleting the element 81 from tree2 In-Order traversal of tree2: -1 12 23 34 49 78 Deleting the element 49 from tree2 In-Order traversal of tree2: -1 12 23 34 78 Deleting the element 12 from tree2 In-Order traversal of tree2: -1 23 34 78 Deleting the element -9 from tree2 No element to delete Element does not exist to delete. ----jGRASP: operation complete.