Q61
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
AnswerB.
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: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board