This program creates two binary search trees, with ten values each. It then deletes a leaf, a node with one child, and a node with two children from each tree. It prints the tree after each deletion using preorder, in order and postorder. PreOrder, Tree1 1 -100 -30 -2 -9 10 20 55 36 99 In Order, Tree1 -100 -30 -9 -2 1 10 20 36 55 99 PostOrder, Tree1 -9 -2 -30 -100 36 99 55 20 10 1 PreOrder, Tree2 7 -22 -99 -33 4 -15 -9 32 8 76 In Order, Tree2 -99 -33 -22 -15 -9 4 7 8 32 76 PostOrder, Tree2 -33 -99 -9 -15 4 -22 8 76 32 7 PreOrder, Tree1 1 -30 -2 10 20 99 36 In Order, Tree1 -30 -2 1 10 20 36 99 PostOrder, Tree1 -2 -30 36 99 20 10 1 PreOrder, Tree2 7 -9 -99 4 32 8 76 In Order, Tree2 -99 -9 4 7 8 32 76 PostOrder, Tree2 -99 4 -9 8 76 32 7 This program has ended normally.