Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without v
Posted: Wed Jul 13, 2022 7:42 pm
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
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