Enter the characters below in the order they are listed into…

Enter the characters below in the order they are listed into an initially empty Binary Search Tree. How many comparisons are needed to locate the letter “T”? I         P         M         H         N         V         T         C         D         E

Imagine a circular array-based queue capable of holding 100…

Imagine a circular array-based queue capable of holding 100 objects. The queue is initially empty, and then objects are put into the queue at the rate of 10 per minute while at the meantime they are processed and removed from the queue at the rate of 5 per minute. This goes on for 14 minutes. 10 items in and 5 items out per minute, for 14 minutes [a] How many objects are in the queue? [b] At what index will the start of the queue be (indices 0 to 99)?