1 votes 1 votes Suppose that we have numbers between $1$ and $1000$ in a binary search tree and we want to search for the number $365$. Which of the following sequences could not be the sequence of nodes examined ? $4, 254, 403, 400, 332, 346, 399, 365$ $926, 222, 913, 246, 900, 260, 364, 365$ $927, 204,913, 242, 914, 247, 365$ $4, 401, 389, 221, 268, 384, 383, 280, 365$ Programming in C ugcnetcse-dec2014-paper3 data-structures binary-search-tree + – makhdoom ghaya asked Jul 28, 2016 recategorized Nov 10, 2017 by Sanjay Sharma makhdoom ghaya 9.6k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply mohit chawla commented Jan 3, 2017 reply Follow Share C is the answer??? 0 votes 0 votes santhoshdevulapally commented Jan 3, 2017 reply Follow Share In the option C---after insertion of node 914 BST is but 914 is >913 but is is left of root node(913),it is violating BST property. 0 votes 0 votes Devshree Dubey commented Jan 3, 2017 reply Follow Share option c is the right answer. 0 votes 0 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes clearly we can see option (c) is wrong Tauhin Gangwar answered Jul 28, 2016 selected Jul 28, 2016 by Prashant. Tauhin Gangwar comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes option C sudsho answered Jan 3, 2017 sudsho comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes ans is c as in option c, 914 can not be travelled after 913 qwertyui answered Jul 28, 2016 qwertyui comment Share Follow See all 0 reply Please log in or register to add a comment.