GATE | GATE CS 1999 | Question 56 Last Updated : 09 Oct, 2017 Improve Improve Like Article Like Save Share Report [5 Marks question] Let A be an n*n matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree which finds 1st, 2nd and 3rd smallest elements in minimum number of comparisons. Answer: Explanation: Quiz of this QuestionPlease comment below if you find anything wrong in the above post Like Article Suggest improvement Previous GATE | GATE CS 1999 | Question 33 Next GATE | GATE CS 1999 | Question 57 Share your thoughts in the comments Add Your Comment Please Login to comment...