After applying the below operations on a input sequence, what happens 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 .search and delete minimum value in priority queue .add that to output .add cartesian tree children of above node to priority queue

Comments and Answers (2)

Andy

Andy

What is the correct solution?

Priya

Priya

does anyone know the correct answer

Avatar

{{SampleComment.userName || "Your Name"}} ~ {{SampleComment.userCity}}

{{SampleComment.commentValue || "Your Answer or Comment goes here...."}}