2 votes 2 votes a binary search tree with n elements are constructed by randomly taking the elements one by one. What is the expected height of the tree Sankaranarayanan P.N asked Jun 4, 2015 Sankaranarayanan P.N 717 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes http://cs.stackexchange.com/questions/6342/proof-that-a-randomly-built-binary-search-tree-has-logarithmic-height So Randomly build binary search tree has logarithmic height ! Ans -> O(log n) Akash Kanase answered Dec 10, 2015 Akash Kanase comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Worst case O(n): if final outcome is SKEWED TREE Average case (log n ): if balanced. So expected hight will be between log n and n narendra answered Jun 7, 2015 narendra comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I think it is ceil(logn) amkrj answered Jun 6, 2015 amkrj comment Share Follow See all 0 reply Please log in or register to add a comment.