Exam 11: Binary Search Trees

Since a heap is a complete 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.

Typically, in heap implementations, we keep track of the position of the last node or, more precisely, the last leaf in the tree.

Heap sort is O(________).

Heap sort is O(______).

A minheap stores its largest element at the root of the binary tree, and both children of the root of a minheap are also minheaps.

The addElement operation for the linked implementation must determine the parent of the next node to be inserted. Why?

The addElement method adds a given ______ element to the appropriate location in the heap, maintaining both the completeness property and the ordering property of the heap.

Though not a queue at all, a ______ provides an efficient implementation of a priority queue.

A minheap stores its smallest element at the ________ of the binary tree.

What is the difference between a minheap and a maxheap?

What does it mean for a heap to be complete?

Though not a queue at all, a minheap provides an efficient implementation of a _____________.

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

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

A ______ stores its smallest element at the root of the binary tree.

To maintain the ______ of the tree, there is only one valid element to replace the root, and that is the element stored in the last leaf in the tree.

Typically, in ______ implementations, we keep track of the position of the last node or, more precisely, the last leaf in the tree.

Why does the addElement operation for the array implementation not have to determine the parent of the next node to be inserted?

What is the time complexity of the removeMin operation?

The addElement method adds a given Comparable element to the appropriate location in the heap, maintaining both the completeness property and the ordering property of the heap.