----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\AskForInput\BinarySearchTree_hermanjl_part1\BSTtest This program will create and modify two binary search trees. Please give six nodes to create the tree. Please type a value for a new node: -5 Inserting -5 Please type a value for a new node: 6 Inserting 6 Please type a value for a new node: 7 Inserting 7 Please type a value for a new node: 23 Inserting 23 Please type a value for a new node: 76 Inserting 76 Please type a value for a new node: 0 Inserting 0 Contents of tree: In order traverse -5 0 6 7 23 76 Pre order traverse -5 6 0 7 23 76 Post order traverse 0 76 23 7 6 -5 Value of a node to be deleted: -5 Removing -5 Contents of tree: -5 0 6 7 23 76 Value of a node to be deleted: 0 Removing 0 Contents of tree: -5 6 7 23 76 Value of a node to be deleted: -5 Removing -5 Contents of tree: -5 6 7 23 76 Making another tree with 6 elements. This program will create and modify two binary search trees. Please give six nodes to create the tree. Please type a value for a new node: 1 Inserting 1 Please type a value for a new node: 2 Inserting 2 Please type a value for a new node: 3 Inserting 3 Please type a value for a new node: 4 Inserting 4 Please type a value for a new node: 5 Inserting 5 Please type a value for a new node: 6 Inserting 6 Contents of tree: In order traverse 1 2 3 4 5 6 Pre order traverse 1 2 3 4 5 6 Post order traverse 6 5 4 3 2 1 Value of a node to be deleted: 6 Removing 6 Contents of tree: 1 2 3 4 5 Value of a node to be deleted: 5 Removing 5 Contents of tree: 1 2 3 4 Value of a node to be deleted: 2 Removing 2 Contents of tree: 1 2 3 4 This program has ended normally. ----jGRASP: operation complete.