Script started on Sun Apr  8 21:47:13 2007
ix$ ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 10 5 15
-------------------------------------------------------------
The tree you created looks like this: 
10
.5
..NULL
..NULL
.15
..NULL
..NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
10
The tree after deleting 10 looks like this:
5
.NULL
.15
..NULL
..NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
5 15 
Performing pre-order traversal of the tree:
5 15 
Performing post-order traversal of the tree:
15 5 
Performing euler traversal of the tree:
5 5 15 15 15 5 
-------------------------------------------------------------
The number of nodes in the tree is 2
The height of the the tree is 1
-------------------------------------------------------------
The tree before swapping looks like this:
5
.NULL
.15
..NULL
..NULL

The tree after swapping  looks like this: 
5
.15
..NULL
..NULL
.NULL

ix$ ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 10 5 15
-------------------------------------------------------------
The tree you created looks like this: 
10
.5
..NULL
..NULL
.15
..NULL
..NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
5
The tree after deleting 5 looks like this:
10
.NULL
.15
..NULL
..NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
10 15 
Performing pre-order traversal of the tree:
10 15 
Performing post-order traversal of the tree:
15 10 
Performing euler traversal of the tree:
10 10 15 15 15 10 
-------------------------------------------------------------
The number of nodes in the tree is 2
The height of the the tree is 1
-------------------------------------------------------------
The tree before swapping looks like this:
10
.NULL
.15
..NULL
..NULL

The tree after swapping  looks like this: 
10
.15
..NULL
..NULL
.NULL

ix$ ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 10 5 15
-------------------------------------------------------------
The tree you created looks like this: 
10
.5
..NULL
..NULL
.15
..NULL
..NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
15
The tree after deleting 15 looks like this:
10
.5
..NULL
..NULL
.NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
5 10 
Performing pre-order traversal of the tree:
10 5 
Performing post-order traversal of the tree:
5 10 
Performing euler traversal of the tree:
10 5 5 5 10 10 
-------------------------------------------------------------
The number of nodes in the tree is 2
The height of the the tree is 1
-------------------------------------------------------------
The tree before swapping looks like this:
10
.5
..NULL
..NULL
.NULL

The tree after swapping  looks like this: 
10
.NULL
.5
..NULL
..NULL

ix$ . ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 10 5 4 3
-------------------------------------------------------------
The tree you created looks like this: 
10
.5
..4
...3
....NULL
....NULL
...NULL
..NULL
.NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
5
The tree after deleting 5 looks like this:
10
.4
..3
...NULL
...NULL
..NULL
.NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
3 4 10 
Performing pre-order traversal of the tree:
10 4 3 
Performing post-order traversal of the tree:
3 4 10 
Performing euler traversal of the tree:
10 4 3 3 3 4 4 10 10 
-------------------------------------------------------------
The number of nodes in the tree is 3
The height of the the tree is 2
-------------------------------------------------------------
The tree before swapping looks like this:
10
.4
..3
...NULL
...NULL
..NULL
.NULL

The tree after swapping  looks like this: 
10
.NULL
.4
..NULL
..3
...NULL
...NULL

ix$ ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 10 5 4 3
-------------------------------------------------------------
The tree you created looks like this: 
10
.5
..4
...3
....NULL
....NULL
...NULL
..NULL
.NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
4
The tree after deleting 4 looks like this:
10
.5
..3
...NULL
...NULL
..NULL
.NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
3 5 10 
Performing pre-order traversal of the tree:
10 5 3 
Performing post-order traversal of the tree:
3 5 10 
Performing euler traversal of the tree:
10 5 3 3 3 5 5 10 10 
-------------------------------------------------------------
The number of nodes in the tree is 3
The height of the the tree is 2
-------------------------------------------------------------
The tree before swapping looks like this:
10
.5
..3
...NULL
...NULL
..NULL
.NULL

The tree after swapping  looks like this: 
10
.NULL
.5
..NULL
..3
...NULL
...NULL

ix$ ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 20 10 5 15 6 25 24 30 29
-------------------------------------------------------------
The tree you created looks like this: 
20
.10
..5
...NULL
...6
....NULL
....NULL
..15
...NULL
...NULL
.25
..24
...NULL
...NULL
..30
...29
....NULL
....NULL
...NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
10
The tree after deleting 10 looks like this:
20
.6
..5
...NULL
...NULL
..15
...NULL
...NULL
.25
..24
...NULL
...NULL
..30
...29
....NULL
....NULL
...NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
5 6 15 20 24 25 29 30 
Performing pre-order traversal of the tree:
20 6 5 15 25 24 30 29 
Performing post-order traversal of the tree:
5 15 6 24 29 30 25 20 
Performing euler traversal of the tree:
20 6 5 5 5 6 15 15 15 6 20 25 24 24 24 25 30 29 29 29 30 30 25 20 
-------------------------------------------------------------
The number of nodes in the tree is 8
The height of the the tree is 3
-------------------------------------------------------------
The tree before swapping looks like this:
20
.6
..5
...NULL
...NULL
..15
...NULL
...NULL
.25
..24
...NULL
...NULL
..30
...29
....NULL
....NULL
...NULL

The tree after swapping  looks like this: 
20
.25
..30
...NULL
...29
....NULL
....NULL
..24
...NULL
...NULL
.6
..15
...NULL
...NULL
..5
...NULL
...NULL

ix$ ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 20 10 5 15 6 25 24 30 29
-------------------------------------------------------------
The tree you created looks like this: 
20
.10
..5
...NULL
...6
....NULL
....NULL
..15
...NULL
...NULL
.25
..24
...NULL
...NULL
..30
...29
....NULL
....NULL
...NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
25
The tree after deleting 25 looks like this:
20
.10
..5
...NULL
...6
....NULL
....NULL
..15
...NULL
...NULL
.24
..NULL
..30
...29
....NULL
....NULL
...NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
5 6 10 15 20 24 29 30 
Performing pre-order traversal of the tree:
20 10 5 6 15 24 30 29 
Performing post-order traversal of the tree:
6 5 15 10 29 30 24 20 
Performing euler traversal of the tree:
20 10 5 5 6 6 6 5 10 15 15 15 10 20 24 24 30 29 29 29 30 30 24 20 
-------------------------------------------------------------
The number of nodes in the tree is 8
The height of the the tree is 3
-------------------------------------------------------------
The tree before swapping looks like this:
20
.10
..5
...NULL
...6
....NULL
....NULL
..15
...NULL
...NULL
.24
..NULL
..30
...29
....NULL
....NULL
...NULL

The tree after swapping  looks like this: 
20
.24
..30
...NULL
...29
....NULL
....NULL
..NULL
.10
..15
...NULL
...NULL
..5
...6
....NULL
....NULL
...NULL

ix$ ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 20 10 5 15 8 7 25 24 32 29 30
-------------------------------------------------------------
The tree you created looks like this: 
20
.10
..5
...NULL
...8
....7
.....NULL
.....NULL
....NULL
..15
...NULL
...NULL
.25
..24
...NULL
...NULL
..32
...29
....NULL
....30
.....NULL
.....NULL
...NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
10
The tree after deleting 10 looks like this:
20
.8
..5
...NULL
...7
....NULL
....NULL
..15
...NULL
...NULL
.25
..24
...NULL
...NULL
..32
...29
....NULL
....30
.....NULL
.....NULL
...NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
5 7 8 15 20 24 25 29 30 32 
Performing pre-order traversal of the tree:
20 8 5 7 15 25 24 32 29 30 
Performing post-order traversal of the tree:
7 5 15 8 24 30 29 32 25 20 
Performing euler traversal of the tree:
20 8 5 5 7 7 7 5 8 15 15 15 8 20 25 24 24 24 25 32 29 29 30 30 30 29 32 32 25 20 
-------------------------------------------------------------
The number of nodes in the tree is 10
The height of the the tree is 4
-------------------------------------------------------------
The tree before swapping looks like this:
20
.8
..5
...NULL
...7
....NULL
....NULL
..15
...NULL
...NULL
.25
..24
...NULL
...NULL
..32
...29
....NULL
....30
.....NULL
.....NULL
...NULL

The tree after swapping  looks like this: 
20
.25
..32
...NULL
...29
....30
.....NULL
.....NULL
....NULL
..24
...NULL
...NULL
.8
..15
...NULL
...NULL
..5
...7
....NULL
....NULL
...NULL

ix$ ./BSTreeWorking 
-------------------------------------------------------------
Enter the a list of integers to be inserted into the tree: 20 10 5 15 8 7 25 24 32 29 30
-------------------------------------------------------------
The tree you created looks like this: 
20
.10
..5
...NULL
...8
....7
.....NULL
.....NULL
....NULL
..15
...NULL
...NULL
.25
..24
...NULL
...NULL
..32
...29
....NULL
....30
.....NULL
.....NULL
...NULL

-------------------------------------------------------------
Please input a key to be deleted from the tree
25
The tree after deleting 25 looks like this:
20
.10
..5
...NULL
...8
....7
.....NULL
.....NULL
....NULL
..15
...NULL
...NULL
.24
..NULL
..32
...29
....NULL
....30
.....NULL
.....NULL
...NULL

-------------------------------------------------------------
Performing in-order traversal of the tree:
5 7 8 10 15 20 24 29 30 32 
Performing pre-order traversal of the tree:
20 10 5 8 7 15 24 32 29 30 
Performing post-order traversal of the tree:
7 8 5 15 10 30 29 32 24 20 
Performing euler traversal of the tree:
20 10 5 5 8 7 7 7 8 8 5 10 15 15 15 10 20 24 24 32 29 29 30 30 30 29 32 32 24 20 
-------------------------------------------------------------
The number of nodes in the tree is 10
The height of the the tree is 4
-------------------------------------------------------------
The tree before swapping looks like this:
20
.10
..5
...NULL
...8
....7
.....NULL
.....NULL
....NULL
..15
...NULL
...NULL
.24
..NULL
..32
...29
....NULL
....30
.....NULL
.....NULL
...NULL

The tree after swapping  looks like this: 
20
.24
..32
...NULL
...29
....30
.....NULL
.....NULL
....NULL
..NULL
.10
..15
...NULL
...NULL
..5
...8
....NULL
....7
.....NULL
.....NULL
...NULL

ix$ exit
exit

Script done on Sun Apr  8 21:48:39 2007