Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?

cartesian tree is impossible when repetitions are present

use any tie-breaking rule between repeated elements

construct a max heap in such cases

construct a min heap in such cases

Consider a sequence of numbers to have repetitions, how a cartesian tr

1.	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
Answer» B. cartesian tree is impossible when repetitions are present