Post #32 392 Aug 14, 2021, 13:00 UTC #algo and some #mathhttps://hbfs.wordpress.com/2021/07/20/binary-trees-are-optimal-except-when-theyre-not/ Harder, Better, Faster, Stronger Binary Trees are optimal… except when they’re not. The best case depth for a search tree is $latex O(\log_b n)$, if $latex b$ is the arity (or branching) of the tree. Intuitively, we know that if we increase $latex b$, the depth goes down, but is t…
TH this->notes. @thisnotes · 4.51K subscribers