4 votes 4 votes Consider the following binary search tree T given below: Which node contains the fourth smallest element in T? Q V W X DS isro2014 data-structures binary-search-tree + – go_editor asked Jul 1, 2016 • edited Dec 9, 2022 by Lakshman Bhaiya go_editor 6.0k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply shivanisrivarshini commented Jun 5, 2016 reply Follow Share Answer is option C i.e W ?? 0 votes 0 votes ManojK commented Jun 5, 2016 reply Follow Share correct c 0 votes 0 votes ManojK commented Jun 5, 2016 reply Follow Share U is smallest then Q is second smallest W is greater than Q and X is smaller then W so X is third smallest . W is forth smallest 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes In these type of question,find INORDER traversal. INORDER TRAVERSAL is arranged in ascending order so in this question 4th element from starting of inorder traversal,i.e., W is 4th smallest element Regina Phalange answered Apr 5, 2017 Regina Phalange comment Share Follow See all 0 reply Please log in or register to add a comment.