U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\AskForInput\B
inarySearchTree_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: 36
36 was inserted into Tree 1.

Please enter an integer: -5
-5 was inserted into Tree 1.

Please enter an integer: -18
-18 was inserted into Tree 1.

Please enter an integer: 72
72 was inserted into Tree 1.

Please enter an integer: 45
45 was inserted into Tree 1.

Please enter an integer: 21
21 was inserted into Tree 1.

You will now be prompted to enter 6 integers for Tree 2.

Please enter an integer: 56
56 was inserted into Tree 2.

Please enter an integer: 92
92 was inserted into Tree 2.

Please enter an integer: 41
41 was inserted into Tree 2.

Please enter an integer: 73
73 was inserted into Tree 2.

Please enter an integer: 24
24 was inserted into Tree 2.

Please enter an integer: 45
45 was inserted into Tree 2.

Tree 1 traversed in order:
        -18         -5         21         36         45         72

Tree 1 traversed in preorder:
         36         -5        -18         21         72         45

Tree 1 traversed in postorder:
        -18         -5         21         45         72         36

Tree 2 traversed in order:
         24         41         45         56         73         92

Tree 2 traversed in preorder:
         56         41         24         45         92         73

Tree 2 traversed in postorder:
         24         41         45         73         92         56


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: 36
The element 36 has been removed from the tree.

The tree in order:
        -18         -5         21         45         72
Enter an element to be deleted from the tree: 45
The element 45 has been removed from the tree.

The tree in order:
        -18         -5         21         72
Enter an element to be deleted from the tree: -5
The element -5 has been removed from the tree.

The tree in order:
        -18         21         72
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: 12
Cannot perform deletion.  The element 12 is not in the tree.

The tree in order:
         24         41         45         56         73         92
Enter an element to be deleted from the tree: 45
The element 45 has been removed from the tree.

The tree in order:
         24         41         56         73         92
Enter an element to be deleted from the tree: 73
The element 73 has been removed from the tree.

The tree in order:
         24         41         56         92

This program has ended normally.

U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\AskForInput\B
inarySearchTree_stultzkm_BSTtest>92