Consider an array-based implementation of a binary search tree bst. Figure presents such a...

Consider an array-based implementation of a binary search tree bst. Figure presents such a representation for a particular binary search tree.

a. Depict the array in an array-based implementation for the binary search tree in Figure.

b. Show the effect of each of the following sequential operations on the array in Part a of this exercise. For simplicity, assume that tree items are names.

bst.insert(new Name("Doug"));

bst.delete(new Name("Karen"));

bst.delete(new Name("Andrew"));

bst.insert(new Name("Sarah"));

c. Repeat Parts a and b of this exercise for the tree in Figure.

d. Write an inorder traversal algorithm for this array-based implementation.