For height-balanced Binary trees, the height is defined to be logarithmic \(O(\log n)\) in the number \(n\) of items.

## References

“Self-Balancing Binary Search Tree.” 2022.

*Wikipedia*, June. https://en.wikipedia.org/w/index.php?title=Self-balancing_binary_search_tree&oldid=1092928206.