1 votes 1 votes certain file system stores records as per binary search tree principles.If the preorder traversal is 90,40,30,190,140,100,290.What is the expected number of comparisons when we randomly request one of the records? DS binary-search-tree numerical-answers + – shreshtha5 asked Nov 30, 2015 • recategorized Jun 24, 2022 by Lakshman Bhaiya shreshtha5 593 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Construct bst from given sequence ..now there will be 1 node at level 0,2 at level 1 ,3 at level 2 and 1 at level 3 no of expected comparisons=1*1+2*2+3*3+1*4/7=18/7=2.57 Pooja Palod answered Nov 30, 2015 Pooja Palod comment Share Follow See all 2 Comments See all 2 2 Comments reply shreshtha5 commented Dec 1, 2015 reply Follow Share thank you 0 votes 0 votes Gate Mm commented Dec 17, 2015 reply Follow Share @pooja can u plz xplain why this multiplication is for? –1 votes –1 votes Please log in or register to add a comment.
