Cartesian Tree MCQ

Test your knowledge with important Cartesian Tree MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Cartesian Tree MCQs at Bissoy

• Cartesian trees solve range minimum query problem in constant time.
  ক

  true

  খ

  false
• A treap is a cartesian tree with ___________
  ক

  additional value, which is a priority value to the key generated randomly

  খ

  additional value, which is a priority value to the key generated sequentially

  গ

  additional heap rule

  ঘ

  additional operations like remove a range of elements
• Cartesian trees are most suitable for?
  ক

  searching

  খ

  finding nth element

  গ

  minimum range query and lowest common ancestors

  ঘ

  self balancing a tree
• What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue
  ক

  constructs a cartesian tree

  খ

  sorts the input sequence

  গ

  does nothing

  ঘ

  produces some random output
• Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?
  ক

  use any tie-breaking rule between repeated elements

  খ

  cartesian tree is impossible when repetitions are present

  গ

  construct a max heap in such cases

  ঘ

  construct a min heap in such cases
• What is the speciality of cartesian sorting?
  ক

  it sorts partially sorted set of data quickly

  খ

  it considers cartesian product of elements

  গ

  it sorts elements in less than O(logn)

  ঘ

  it is a self balancing tree
• Which of the below statements are true? i. Cartesian tree is not a height balanced tree ii. Cartesian tree of a sequence of unique numbers can be unique generated
  ক

  both statements are true

  খ

  only i. is true

  গ

  only ii. is true

  ঘ

  both are false
• Is the below tree representation of 50,100,400,300,280 correct way to represent cartesian tree?
  ক

  true

  খ

  false
• What is a Cartesian tree?
  ক

  a skip list in the form of tree

  খ

  a tree which obeys cartesian product

  গ

  a tree which obeys heap property and whose inorder traversal yields the given sequence

  ঘ

  a tree which obeys heap property only