One doc tagged with "avl"

A binary search tree is $O(\log n)$ only while it stays short, and nothing in the plain