Explore topic-wise MCQs in Data Structure.

This section includes 3 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.

Cartesian trees solve range minimum query problem in constant time.

A. true
B. false
Answer» B. false
Discussion
2.

A treap is a cartesian tree with ___________

A. additional value, which is a priority value to the key generated randomly
B. additional value, which is a priority value to the key generated sequentially
C. additional heap rule
D. additional operations like remove a range of elements
Answer» B. additional value, which is a priority value to the key generated sequentially
Discussion
3.

Which of the below statements are true?
i. Cartesian tree is not a height balanced tree

A. nii. Cartesian tree of a sequence of unique numbers can be unique generated
B. both statements are true
C. only i. is true
D. only ii. is true
E. both are false
Answer» B. both statements are true
Discussion