CS STUDY

The following figure shows the merge sort tree for sorting 8 elements. When sorting n elements, the asymptotically tight bound for the height of the merge sort tree is _____

All operations of binary search tree starts at the _____

Although not getting into the details, we have mentioned in the class several balanced trees, which of the following are not one of them?

The insertion of an element into a binary search tree starts with an _____

A heap storing n elements has a height of ______

The ____ sort algorithm cannot be easily implemented as an in-place sorting algorithm

The _____ traversal of a binary search tree renders all elements in sorted order of the keys

A divide - and - conquer algorithm is always a ____ algorithm.

Worst case performance of the quick sort algorithm happens _________.

Because of the ______, the element with the smallest key can always be found at the root of a minHeap.

Both the merge sort and quick sort are _______ algorithms.

The best asymptotically tight bound for insertion sort is _________

In general, hash functions consist of two components, they are ______

Because of the _____, a heap can be efficiently represented by an array-based sequence

There are three steps in divide-and-conquer algorithms. They are:

Which of the following implementation of hash table allows a load factor greater than 1

If we use a heap to implement the priority queue ADT and use the priority queue to implement the priority queue sort algorithm, then the resulting algorithm is _______ sort.

The asymptotically tight bound for worse case performance in comparison based sorting algorithms cannot be better than ______