Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?
(a) use any tie-breaking rule between repeated elements
(b) cartesian tree is impossible when repetitions are present
(c) construct a max heap in such cases
(d) construct a min heap in such cases
I'd like to ask this question from Cartesian Tree topic in section Binary Trees of Data Structures & Algorithms I
This question was posed to me by my school teacher while I was bunking the class.