Explore topic-wise MCQs in Data Structure.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.

1.

An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

A. O(n*n*logn)
B. O(n*logn)
C. O(n*n)
D. O(n *logn *logn)
Answer» C. O(n*n)
Discussion
2.

The worst case complexity of deleting any arbitrary node value element from heap is __________

A. O(logn)
B. O(n)
C. O(nlogn)
D. O(n<sup>2</sup>)
Answer» B. O(n)
Discussion