We store the tree nodes in level-order traversal in heap sort?
a) True
b) False
c) NA
d) NA
One of the clever aspects of is that they can be stored in arrays without using any pointers.
a) lists
b) BST trees
c) heaps
d) none
Thus the smallest key is in the root in a….; in the….the largest is in the root.
a) max heap, min heap
b) min heap, max heap
c) min heap, min heap
d) max heap, max heap
In a….heap, the parent has a key larger than or equal both of its children.
a) (max) heap
b) (min) heap
c) N/A
d) NA
The heap order property stated that in a…., for every node X, the key in the parent is smaller than or equal to the key in X.
a) (max) heap
b) (min) heap
c) NA
d) N/A
A….is a left-complete binary tree that conforms to the heap order.
a) BST
b) AVL Tree
c) Perfect Tree
d) Heap
