ÏÏÏÏ
ÏÏ«Ï ----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\HardcodeTests\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
ÏÏ§Ï
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï         10          0         -2          5         20         15         30         23         32
ÏÏ§Ïpost-order
ÏÏ§Ï         -2          5          0         15         23         32         30         20         10
ÏÏ§Ïend of adams insertion 
ÏÏ§Ï 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.
ÏÏÏÏ
ÏÏ«Ï ----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\HardcodeTests\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
ÏÏ§Ï
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï         10          0         -2          5         20         15         30         23         32
ÏÏ§Ïpost-order
ÏÏ§Ï         -2          5          0         15         23         32         30         20         10
ÏÏ§Ïend of adams insertion 
ÏÏ§Ï 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
ÏÏ§Ï
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï         10          0         -2          5         20         15         30         23
ÏÏ§Ïpost-order
ÏÏ§Ï         -2          5          0         15         23         30         20         10
ÏÏ§Ïend of adams insertion 
ÏÏ§Ï 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
ÏÏ§Ï
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï         10          0         -2          5         20         15         23
ÏÏ§Ïpost-order
ÏÏ§Ï         -2          5          0         15         23         20         10
ÏÏ§Ïend of adams insertion 
ÏÏ§Ï 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
ÏÏ§Ï
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï         10          0         -2          5         15         23
ÏÏ§Ïpost-order
ÏÏ§Ï         -2          5          0         23         15         10
ÏÏ§Ïend of adams insertion 
ÏÏ§Ï
ÏÏ§Ï
ÏÏ§ÏThis program terminated normally.
ÏÏ§Ï
ÏÏ©Ï ----jGRASP: operation complete.
¼¼ÏÏ