1 votes 1 votes Suppose we constructed the binary search tree shown below by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations or other manipulations. Which of the following assertions about the order of elements in the input sequence $cannot$ be true? $8$ came after $3$ and $19$ came after $29$. $7$ came before $8$ and $23$ came after $37$. $1$ came after $12$ and $29$ came before $42$. $3$ came before $14$ and $16$ came before $28$. DS cmi2017 data-structures binary-search-tree + – Tesla! asked Feb 4, 2018 edited Apr 8, 2019 by akash.dinkar12 Tesla! 750 views answer comment Share Follow See 1 comment See all 1 1 comment reply Himanshu Kumar Gupta commented Aug 24, 2020 reply Follow Share option D is not possible.. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Answer (D) 16 came before 28 is not possible because then 16 would be child of 15 and 28 would be child of 16 but in given diagram 16 is child of 28. child cannot come before parent (ancestor) in binary search tree Tesla! answered Feb 5, 2018 Tesla! comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer: soujanyareddy13 answered May 6, 2021 soujanyareddy13 comment Share Follow See all 0 reply Please log in or register to add a comment.