PLEASE ANSWER THIS

1. Draw the structure of a binary search tree

a. after these values have been inserted: 19, 34, 23, 16, 54, 89, 24, 29, 15, 61, 27.

b. after two delete operations (deleting the root)

2. Draw the structure of a binary heap (MinHeap):

a. after these priorities have been inserted: 19, 34, 23, 16, 54, 89, 24, 29, 15, 61, 27.

b. after two deleteMin operations (using the tree in (a)).