----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\BinarySearchTree_hartwaer_BSTtest\BSTtest
    
    This program will make two binary search trees 
    and delete from each tree a leaf, a node with 
    only 1 child, a node with 2 children
    
    we will now creat the first tree
    we will now creat the second tree
    heres tree one inorder
        4    7   10   13   14   15   16
    heres tree two inorder
        2    6    8   12   15   18   20
    
    the leaf 16 has been deleted
        4    7   10   13   14   15
    the one child node 15 has been deleted
        4    7   10   13   14
    the two child node 7 has been deleted
        4   10   13   14
    the leaf 20 has been deleted
        2    6    8   12   15   18
    the one child node 18 has been deleted
        2    6    8   12   15
    the two child node 6 has been deleted
        2    8   12   15
    the program ended normally
    
     ----jGRASP: operation complete.