----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\AskForInput\BinarySearchTree_stultzkm_BSTtest\BSTtest
    
    This program will create two binary search trees and perform various actions on them.
    You will now be prompted to enter 6 integers for Tree 1.
    
    Please enter an integer: -5
    -5 was inserted into Tree 1.
    
    Please enter an integer: 6
    6 was inserted into Tree 1.
    
    Please enter an integer: 7
    7 was inserted into Tree 1.
    
    Please enter an integer: 23
    23 was inserted into Tree 1.
    
    Please enter an integer: 76
    76 was inserted into Tree 1.
    
    Please enter an integer: 0
    0 was inserted into Tree 1.
    
    You will now be prompted to enter 6 integers for Tree 2.
    
    Please enter an integer: 1
    1 was inserted into Tree 2.
    
    Please enter an integer: 2
    2 was inserted into Tree 2.
    
    Please enter an integer: 3
    3 was inserted into Tree 2.
    
    Please enter an integer: 4
    4 was inserted into Tree 2.
    
    Please enter an integer: 5
    5 was inserted into Tree 2.
    
    Please enter an integer: 6
    6 was inserted into Tree 2.
    
    Tree 1 traversed in order: 
             -5          0          6          7         23         76
    
    Tree 1 traversed in preorder: 
             -5          6          0          7         23         76
    
    Tree 1 traversed in postorder: 
              0          6          7         23         76         -5
    
    Tree 2 traversed in order: 
              1          2          3          4          5          6
    
    Tree 2 traversed in preorder: 
              1          2          3          4          5          6
    
    Tree 2 traversed in postorder: 
              2          3          4          5          6          1
    
    
    You will now be prompted to delete 3 elements from tree 1.
    Please delete a leaf, a node with one child, and a node with two children.
    
    Enter an element to be deleted from the tree: 0
    The element 0 has been removed from the tree.
    
    The tree in order:
             -5          6          7         23         76
    Enter an element to be deleted from the tree: 5
    Cannot perform deletion.  The element 5 is not in the tree.
    
    The tree in order:
             -5          6          7         23         76
    Enter an element to be deleted from the tree: -5
    The element -5 has been removed from the tree.
    
    The tree in order:
              6          7         23         76
    You will now be prompted to delete 3 elements from tree 2.
    Please delete a leaf, a node with one child, and a node with two children.
    
    Enter an element to be deleted from the tree: -5
    Cannot perform deletion.  The element -5 is not in the tree.
    
    The tree in order:
              1          2          3          4          5          6
    Enter an element to be deleted from the tree: 1
    The element 1 has been removed from the tree.
    
    The tree in order:
              2          3          4          5          6
    Enter an element to be deleted from the tree: 4
    The element 4 has been removed from the tree.
    
    The tree in order:
              2          3          5          6
    
    This program has ended normally.
    
     ----jGRASP: operation complete.