ÏÏÏÏ
ÏÏ«Ï ----jGRASP exec: U:\Web\CS240_Fall_2007\Fall 07 CS 240 assignments\BinarySearchTree\HardcodeTests\BinarySearchTree_hartwaer_BSTtest\BSTtest
ÏÏ§Ï
ÏÏ§ÏThis program will make two binary search trees 
ÏÏ§Ïand delete from each tree a leaf, a node with 
ÏÏ§Ïonly 1 child, a node with 2 children
ÏÏ§Ï
ÏÏ§Ïwe will now creat the first tree
ÏÏ§Ïwe will now creat the second tree
ÏÏ§Ïheres tree one inorder
ÏÏ§Ï    4    7   10   13   14   15   16
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï   13    7    4   10   15   14   16
ÏÏ§Ïpost-order
ÏÏ§Ï    4   10    7   14   16   15   13
ÏÏ§Ïend of adams insertion 
ÏÏ§Ïheres tree two inorder
ÏÏ§Ï    2    6    8   12   15   18   20
ÏÏ§Ï
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï   12    6    2    8   18   15   20
ÏÏ§Ïpost-order
ÏÏ§Ï    2    8    6   15   20   18   12
ÏÏ§Ïend of adams insertion 
ÏÏ§Ïthe leaf 16 has been deleted
ÏÏ§Ï    4    7   10   13   14   15
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï   13    7    4   10   15   14
ÏÏ§Ïpost-order
ÏÏ§Ï    4   10    7   14   15   13
ÏÏ§Ïend of adams insertion 
ÏÏ§Ïthe one child node 15 has been deleted
ÏÏ§Ï    4    7   10   13   14
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï   13    7    4   10   14
ÏÏ§Ïpost-order
ÏÏ§Ï    4   10    7   14   13
ÏÏ§Ïend of adams insertion 
ÏÏ§Ïthe two child node 7 has been deleted
ÏÏ§Ï    4   10   13   14
ÏÏ§Ï beginning of Adams insertion 
ÏÏ§Ïpre-order
ÏÏ§Ï   13    4   10   14
ÏÏ§Ïpost-order
ÏÏ§Ï   10    4   14   13
ÏÏ§Ïend of adams insertion 
ÏÏ§Ïthe leaf 20 has been deleted
ÏÏ§Ï    2    6    8   12   15   18
ÏÏ§Ïthe one child node 18 has been deleted
ÏÏ§Ï    2    6    8   12   15
ÏÏ§Ïthe two child node 6 has been deleted
ÏÏ§Ï    2    8   12   15
ÏÏ§Ïthe program ended normally
ÏÏ§Ï
ÏÏ©Ï ----jGRASP: operation complete.
¼¼ÏÏ