Exam 11: Binary Search Trees

What is the time complexity of the addElement operation?

The __________ method consists of adding each of the elements of the list to a heap and then removing them one at a time.

Heap sort is O(n log n).

The addElement operation for both the linked and array implementations is O(n log n).

Since a heap is a ______ tree, there is only one correct location for the insertion of a new node, and that is either the next open position from the left at level h or the first position on the left at level h+1 if level h is full.

The heapSort method consists of adding each of the elements of the list to a heap and then removing them one at a time.

What is the time complexity of heap sort?

The addElement operation for both the linked and array implementations is O(______).

Because of the requirement that we be able to traverse up the tree after an insertion, it is necessary for the nodes in a heap to store a pointer to their ________.

In an array implementation of a binary tree, the root of the tree is in position 0, and for each node n, n's left child is in position 2(n+1) and n's right child is in position 2(n+2).