Heaps MCQ question and answer with solution | Data Structure MCQs

A. n

B. n-1

C. n/2

D. logn

A. 1

B. 2

C. 3

D. 4

A. A[Parent(i)] =A[i]

B. A[Parent(i)] <= A[i]

C. A[Parent(i)] >= A[i]

D. A[Parent(i)] > 2 * A[i]

A. logarithmic and linear time constant respectively

B. constant and linear time respectively

C. constant and quadratic time respectively

D. constant and logarithmic time respectively

A. O(N)

B. O( log N)

C. O( N log N)

D. O(N²)

A. root node

B. right most child

C. left most child

D. left sibling

A. Min-heap

B. Max-heap

C. Relaxed -heap

D. Leonardo heap

A. O(N)

B. O(log N)

C. O(N log N)

D. O(N²)

A. 31

B. 10

C. 18

D. 20

A. 1

B. -1

C. 0

D. null