Vidyalelo
Data Structure · Q55

Binary Search Trees(B Tree)

Programming · Data Structure · question 55

Q55

What is a Cartesian tree?

A.
a skip list in the form of tree
B.
a tree which obeys cartesian product
C.
a tree which obeys heap property and whose inorder traversal yields the given sequence
Answer
D.
a tree which obeys heap property only

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Binary Search Trees(B Tree) questions