----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\BinarySearchTree_bryan5jm_BSTTest\BSTTest
    
    |||||  BSTTester  |||||
    
     This program builds two trees and deletes from each tree
     a leaf, a node with only 1 child, and a node with 2 children.
    
    
    THE FIRST BINARY SEARCH TREE:
    
     Setting the first tree's root to 50.
       inserting a 30
       inserting a -13
       inserting a 34
       inserting a 32
       inserting a 35
       inserting a 55
       inserting a 100
       inserting a 56
    
    The first binary search tree holds these values (inorder):
            -13         30         32         34         35         50         55         56        100
    
     Deleting a leaf of the first tree - 56
    After deletion, the first binary search tree holds these values (inorder):
            -13         30         32         34         35         50         55        100
    
     Deleting a node of the first tree with only one child - 55
    After deletion, the first binary search tree holds these values (inorder):
            -13         30         32         34         35         50        100
    
     Deleting a node of the first tree with two children - 34
    After deletion, the first binary search tree holds these values (inorder):
            -13         30         32         35         50        100
    
    
    
    THE SECOND BINARY SEARCH TREE:
    
     Setting the second tree's root to 10.
       inserting a 0
       inserting a -2
       inserting a 5
       inserting a 20
       inserting a 15
       inserting a 30
       inserting a 23
       inserting a 32
    
    The second binary search tree holds these values (inorder):
             -2          0          5         10         15         20         23         30         32
    
     Deleting a leaf of the second tree - 32
    After deletion, the second binary search tree holds these values (inorder):
             -2          0          5         10         15         20         23         30
    
     Deleting a node of the second tree with only one child - 30
    After deletion, the second binary search tree holds these values (inorder):
             -2          0          5         10         15         20         23
    
     Deleting a node of the second tree with two children - 20
    After deletion, the second binary search tree holds these values (inorder):
             -2          0          5         10         15         23
    
    
    
    This program terminated normally.
    
     ----jGRASP: operation complete.