Consider an array-based implementation of a binary search tree bst. Figure 16-1 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 15-14 a of Chapter 15 . Assume that tree items are strings.
b. Show the effect of each of the following sequential operations on the array in part a of this exercise.
![233_28167290-4e4a-47f3-a571-82a96d8d2fd4.png](https://secure.tutorsglobe.com/CMSImages/233_28167290-4e4a-47f3-a571-82a96d8d2fd4.png)
c. Repeat parts a and b of this exercise for the tree in Figure 15-14 b.
d. Write an inorder traversal algorithm for this array-based implementation.
![1095_0df0766e-4d94-4e9b-8add-cee88fde61e3.png](https://secure.tutorsglobe.com/CMSImages/1095_0df0766e-4d94-4e9b-8add-cee88fde61e3.png)