JAVA

What is the runtime of a search operation in a red black tree Explain how to delete items from a binary search tree Starting from the binary search tree shown below, draw the binary search tree that results after the following operation: insert(39) Explain the recursion clearly (base case etc) Describe in detail (using pseudocode) the implementation of a priority queue based on a sorted array. Show that your implementation achieves 0(1) for operations min and removeMin, and 0(n) for insertions. Say that an n-vertex directed acyclic graph G is compact if there is some way of numbering the vertices of with the integers from 0 to n-l such that G contains the edge (i,j) if and only if i