Q198
What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue
A.
constructs a cartesian tree
B.
sorts the input sequence
AnswerC.
does nothing
D.
produces some random output
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board