2 votes 2 votes For inorder traversal of a BST, which of the following statements is TRUE? O/p is always in sorted decreasing order. O/p always in sorted increasing order It does not sort the number at all. O/p always in reverse sorted decreasing order. Programming in C tbb-ds-2 + – Bikram asked Nov 26, 2016 • edited Aug 19, 2019 by Counsellor Bikram 212 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shubhanshu commented May 2, 2017 reply Follow Share but sir if we have all the keys to be inserted in the binary tree are all equal then we will get non decreasing order. crct me if i am wrong? 1 votes 1 votes Lakshman Bhaiya commented Aug 19, 2019 reply Follow Share Yes You are right. 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes In-order Traversal of Binary Search Tree is always sorted in Ascending Order. So, the answer is $(B)$. Abhisek Tiwari 4 answered Oct 15, 2018 • selected Aug 19, 2019 by Bikram Abhisek Tiwari 4 comment Share Follow See all 0 reply Please log in or register to add a comment.