----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\BinarySearchTree_smith3at_BinarySearchTree\BSTTest
    
    Welcome, this program will get input and organize the input in a binary tree.
    Now adding 25 as the root of the first tree 
    Now adding 30 to the first tree 
    Now adding 20 to the first tree 
    Now adding 35 to the first tree 
    Now adding 15 to the first tree 
    Now adding 40 to the first tree 
    Now adding 17 to the first tree 
    Now adding 0 as the root of the second tree 
    Now adding 10 to the second tree 
    Now adding 5 to the second tree 
    Now adding 15 to the second tree 
    Now adding -5 to the second tree 
    Now adding -3 to the second tree 
    Now adding -8 to the second tree 
    The In order traversal of the first tree: 
             15
             17
             20
             25
             30
             35
             40
    The Preorder traversal of the first tree: 
             25
             20
             15
             17
             30
             35
             40
    The Postorder traversal of the first tree: 
             17
             15
             20
             40
             35
             30
             25
    The In order traversal of the second tree: 
             15
             17
             20
             25
             30
             35
             40
    The Preorder traversal of the second tree: 
             25
             20
             15
             17
             30
             35
             40
    The Postorder traversal of the second tree: 
             17
             15
             20
             40
             35
             30
             25
    Searching the first tree for 30 
    Value was found.
    Searching the second tree for -500 
    Value was not found.
    Now removing 40 from the first tree 
    The In order traversal of the tree after removal of element: 
             15
             17
             20
             25
             30
             35
    Now removing 20 from the first tree 
    The In order traversal of the tree after removal of element: 
             15
             17
             25
             30
             35
    Now removing 25 from the first tree 
    The In order traversal of the tree after removal of element: 
             15
             17
             30
             35
    Now removing 10 from the first tree 
    value does not exist.The In order traversal of the tree after removal of element: 
             15
             17
             20
             25
             30
             35
             40
    Now removing -8 from the first tree 
    value does not exist.The In order traversal of the tree after removal of element: 
             15
             17
             20
             25
             30
             35
             40
    Now removing -5 from the first tree 
    value does not exist.The In order traversal of the tree after removal of element: 
             15
             17
             20
             25
             30
             35
             40
    This program has ended normally.
    
     ----jGRASP: operation complete.
    
     ----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\BinarySearchTree_siltzma_BSTOutput\BSTtest
    
    This program creates two binary search trees, with ten values
    each. It then deletes a leaf, a node with one child, and a node
    with two children from each tree. It prints the tree after each
    deletion using preorder, in order and postorder.
    
    PreOrder, Tree1
        1 -100  -30   -2   -9   10   20   55   36   99
    In Order, Tree1
     -100  -30   -9   -2    1   10   20   36   55   99
    PostOrder, Tree1
       -9   -2  -30 -100   36   99   55   20   10    1
    
    PreOrder, Tree2
        7  -22  -99  -33    4  -15   -9   32    8   76
    In Order, Tree2
      -99  -33  -22  -15   -9    4    7    8   32   76
    PostOrder, Tree2
      -33  -99   -9  -15    4  -22    8   76   32    7
    
    PreOrder, Tree1
        1  -30   -2   10   20   99   36
    In Order, Tree1
      -30   -2    1   10   20   36   99
    PostOrder, Tree1
       -2  -30   36   99   20   10    1
    
    PreOrder, Tree2
        7   -9  -99    4   32    8   76
    In Order, Tree2
      -99   -9    4    7    8   32   76
    PostOrder, Tree2
      -99    4   -9    8   76   32    7
    
    
    This program has ended normally.
    
     ----jGRASP: operation complete.