----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\BinarySearchTree_spikerjl_BSTTest\BSTTest Welcome to the binary search tree program! This program will set up a binary search tree with a set of random numbers in the range -20..20 and will attempt to find a random number in the tree before attempting to delete a random number from the tree. This process will be executed twice to thoroughly test the procedures used. Enjoy! Filling the binary search tree with a new set of random numbers... Putting 13 in the tree. Putting -4 in the tree. Putting 4 in the tree. Putting -6 in the tree. Putting -18 in the tree. Putting -7 in the tree. Putting 7 in the tree. Putting 6 in the tree. Putting -3 in the tree. Putting 20 in the tree. Putting -11 in the tree. Putting -2 in the tree. Putting -18 in the tree. This number is already in the tree, no change. Putting -12 in the tree. Putting -18 in the tree. This number is already in the tree, no change. Putting 9 in the tree. Putting 3 in the tree. Putting 0 in the tree. Putting -1 in the tree. Putting -15 in the tree. This is what an in-order traversal of the tree looks like: -18 -15 -12 -11 -7 -6 -4 -3 -2 -1 0 3 4 6 7 9 13 20 This is what a pre-order traversal of the tree looks like: -15 -12 -11 -7 -18 -6 -1 0 3 -2 -3 6 9 7 4 -4 20 13 This is what a post-order traversal of the tree looks like: 13 -4 -6 -18 -7 -11 -12 -15 4 -3 -2 3 0 -1 7 6 9 20 Searching for -2 Was the number found? TRUE Attempting to delete from the tree: 13 The delete was successful. Attempting to delete from the tree: 20 The delete was successful. Attempting to delete from the tree: 9 The delete was successful.