MadeEasy Subject Test: Programming & DS - Binary Search Tree

Question

Consider file system stores records as per binary search tree principles. If the postorder traversal of records is given by 2, 4, 3, 9, 13, 7, 6, 17, 20, 18, 15. The expected number of comparisons when we randomly request one of the records (upto 2 decimal places) is _____.

Answer 1

ans- 3.091 ?

Comments

would u please elaborate how you have find tha ans that much ..

---

@ jitu123

https://gateoverflow.in/163986/expectation-and-bst#c163994

---

@ jitu123

First construct the BST and then give a look at this

https://gateoverflow.in/11447/number-of-comparision-in-searching-in-bst