0 votes 0 votes DS testbook-test-series data-structures binary-search-tree + – sidlewis asked Sep 1, 2018 recategorized Mar 12, 2019 by ajaysoni1924 sidlewis 633 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Magma commented Sep 2, 2018 reply Follow Share Shaik Masthan how would you get 311 and 437 ??? i got 311 and 436 as a mid 0 votes 0 votes Magma commented Sep 2, 2018 reply Follow Share yes answer should be D ) ist iteration : mid = (0+998)/2 = 499 2nd iteration : mid = (500 + 998)/2 = 749 3rd iteration : mid = 500+ 748 /2 = 624 4th iteration : mid = 500 + 623 /2 = 561.5 = 561 Similarly ist iteration : mid = (0+998)/2 = 499 2nd iteration : mid = (500 + 998)/2 = 749 3rd iteration : mid = 500+ 748 /2 = 624 4th iteration : mid = 625 + 748 /2 = 686.5 = 686 1 votes 1 votes Shaik Masthan commented Sep 2, 2018 reply Follow Share @Magma yes, i made mistake, taken the indexes wrongly 0 votes 0 votes Please log in or register to add a comment.