----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\BinarySearchTree_shermajs_searchtree\BSTtest
    
    
       **Test program for the binary tree program***
    
    Building the first tree with six integers: 
    
    Traversals:
    In-order traversal:   30  40  43  45  50  60
    Pre-order traversal:   50  40  30  45  43  60
    Post-order traversal:   30  43  45  40  60  50
    
    First value to delete:  60
    deleting your value...
    This node is a leaf.
    
    Second value to delete:  45
    deleting your value...
    This node has one child.
    
    Third value to delete:  40
    deleting your value...
    This node has two children.
    This node is a leaf.
    
    Building the second tree with six integers: 
    
    Traversals:
    In-order traversal:   10  20  28  29  30  38
    Pre-order traversal:   20  10  30  28  29  38
    Post-order traversal:   10  29  28  38  30  20
    
    First value to delete:  10
    deleting your value...
    This node is a leaf.
    
    Second value to delete:  28
    deleting your value...
    This node has one child.
    
    Third value to delete:  30
    deleting your value...
    This node has two children.
    This node is a leaf.
    
    This program ended normally.
    
     ----jGRASP: operation complete.