What is the average asymptotic depth of a simple unbalanced search tree?
This might help you The average height of Binary Trees is Theta(sqrt(n)).
This has been shown (or referenced, not very sure) in the following paper:
you are more interested in t
Date : October 23 2020, 11:12 PM , By : dam