4 votes 4 votes Here how did we find the number of comparisons for any number. Algorithms data-structures binary-search-tree + – junaid ahmad asked Oct 29, 2017 junaid ahmad 911 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments saxena0612 commented Oct 29, 2017 reply Follow Share Now if you want to search for 9 then sequence would be : 15->6->7->13->9[FOUND] Total comparisons : 5 which is the last element i mentioned in the last comment. 1 votes 1 votes junaid ahmad commented Oct 29, 2017 reply Follow Share Thanks saxena0612 :) 0 votes 0 votes Deepalitrapti commented Jul 2, 2019 reply Follow Share Oky 0 votes 0 votes Please log in or register to add a comment.