A. Which trees (if any of Tree A, Tree B, Tree C) are balanced? B. Consider the following order of nodes which was printed as a result of a tree traversal: A, C, E, G, I, K. For which trees (if any) does this order correspond to an in-order traversal? C. Consider the following order of nodes which was printed as a result of a tree traversal: A, C, E, G, I, K. For which trees (if any) does this order correspond to a postorder traversal? D. Consider the following order of nodes which was printed as a result of a tree traversal: A, E, C, G, I, K. For which trees (if any) does this order correspond to a preorder traversal? E. Starting from Tree A as depicted in Figure 2, if character B is now inserted into Tree A, redraw the resulting tree. Indicate only the shape of the tree and the location of the inserted node. F. Starting from Tree B as depicted in Figure 2, if character B is now inserted into Tree B, redraw the resulting tree. Indicate only the shape of the tree and the location of the inserted node. G. Starting from Tree B as depicted in Figure 2, if character G is now deleted, redraw the resulting tree. Indicate both the shape of the tree and the values in all of the nodes. H. Starting from Tree A (as depicted in Figure 2), if the insertion algorithm descends according to the path right, left and then inserts a value as a right child, what value was inserted?