Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 10
What is a Cartesian tree of an array?
A
A binary tree that is heap-ordered by value and whose in-order traversal gives the original array
B
A tree of (x, y) coordinates
C
A tree storing products
D
A balanced BST of indices