(A) True
(B) False
(C) NA
(D) NA
Tag: Fundamentals of Computer Algorithms
Access to nodes involves simple arithmetic operations: shown in below left(i) : returns 2i, index of left child of node i. right(i) : returns 2i + 1, the right child. parent(i) : returns bi/2c, the parent of i.?
(A) True
(B) False
(C) NA
(D) NA
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 , max heap
(D) min heap , min heap
In a __ heap, the parent has a key larger than or equal both of its children.
(A) (max) heap
(B) (min) heap
(C) NA
(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) NA
A __ is a left-complete binary tree that conforms to the heap order.
(A) BST
(B) AVL Tree
(C) Perfect tree
(D) Heap