MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structure
→
Number Jumps Reach End Array Operation in Data Structure
→
Cartesian trees solve range minimum query problem ..
1.
Cartesian trees solve range minimum query problem in constant time.
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Cartesian trees solve range minimum query problem in constant time.
A treap is a cartesian tree with ___________
Which of the below statements are true?<br>i. Cartesian tree is not a height balanced tree
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply