3 votes 3 votes A binary search tree is used to locate the number $43.$ Which of the following probe sequence is not possible? $61 \quad 52 \quad 14 \quad 17 \quad 40 \quad 43$ $23 \quad 50 \quad 40 \quad 60 \quad 43$ $10 \quad 65 \quad 31\quad 48\quad 37 \quad 43$ $81 \quad 61 \quad 52 \quad 14 \quad 41 \quad 43$ Programming in C algorithms binary-search-tree + – sh!va asked Jul 12, 2016 edited Jan 12, 2022 by Lakshman Bhaiya sh!va 5.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply LeenSharma commented Jul 12, 2016 reply Follow Share https://gateoverflow.in/2756/gate1996_4 0 votes 0 votes Please log in or register to add a comment.
Best answer 8 votes 8 votes The right answer for this question is B. Pankaj kumar answered Jul 12, 2016 selected Jul 12, 2016 by sh!va Pankaj kumar comment Share Follow See all 2 Comments See all 2 2 Comments reply sh!va commented Jul 12, 2016 reply Follow Share Perfect explanation.. Thank u for ur effort :) 0 votes 0 votes vishnu777 commented Jul 1, 2022 reply Follow Share Can you give any short and simple approach apart from constructing and analysing BST 0 votes 0 votes Please log in or register to add a comment.