U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\AskF
inarySearchTree_akhmetma_BinarySearchTree>bsttest
The program is going to create 2 binary
trees, and for each binary tree:
  the program is going to get 6 integers
  from the user and store in the proper
  places in a binary tree. Then these
  integers are going to be printed out by
  traversing the binary tree in inorder,
  postorder and preorder traversal
  algorithms. After that the user
  will try the delete feature of the
  program.
NOTE: the search feature is tested with
      only the first binary tree

--- The First Binary Tree ---
Enter an integer value: 15
Enter an integer value: 25
Enter an integer value: 10
Enter an integer value: 12
Enter an integer value: 5
Enter an integer value: 20


--- The Second Binary Tree ---
Enter an integer value: 36
Enter an integer value: -5
Enter an integer value: -18
Enter an integer value: 72
Enter an integer value: 45
Enter an integer value: 21


-- TESTING INORDER TRAVERSE --
Printing the elements of the 1st binary
tree using InOrder traversal algorithm:
    5   10   12   15   20   25

Printing the elements of the 2nd binary
tree using InOrder traversal algorithm:
  -18   -5   21   36   45   72

-- TESTING POSTORDER TRAVERSE --
Printing the elements of the 1st binary
tree using PostOrder traversal algorithm:
    5   12   10   20   25   15

Printing the elements of the 2nd binary
tree using PostOrder traversal algorithm:
  -18   21   -5   45   72   36

-- TESTING PREORDER TRAVERSE --
Printing the elements of the 1st binary
tree using PreOrder traversal algorithm:
   15   10    5   12   25   20

Printing the elements of the 2nd binary
tree using PreOrder traversal algorithm:
   36   -5  -18   21   72   45

For which integer you want to search in the first binary tree : 10

The integer 10 is found in the first binary tree.

-- Deleting elements of the 1st binary tree --
What value you want to delete in the binary tree (enter an integer): 5

Deleting an element of the binary tree...

The values stored in binary tree:
   10   12   15   20   25

What value you want to delete in the binary tree (enter an integer): 10

Deleting an element of the binary tree...

The values stored in binary tree:
   12   15   20   25

What value you want to delete in the binary tree (enter an integer): 15

Deleting an element of the binary tree...

The values stored in binary tree:
   12   20   25

-- Deleting elements of the 2nd binary tree --
What value you want to delete in the binary tree (enter an integer): 36

Deleting an element of the binary tree...

The values stored in binary tree:
  -18   -5   21   45   72

What value you want to delete in the binary tree (enter an integer): 45

Deleting an element of the binary tree...

The values stored in binary tree:
  -18   -5   21   72

What value you want to delete in the binary tree (enter an integer): -5

Deleting an element of the binary tree...

The values stored in binary tree:
  -18   21   72

--- THE PROGRAM HAS ENDED SUCCESSFULLY ---