Closed
Description
book/content/part03/map.asc:
* *TreeMap*: it’s a map implementation that uses a self-balanced Binary Search Tree (like <<c-avl-tree#>>). The BST nodes store the key, and the value and nodes are sorted by key guaranteeing an *O(log n)* look up.book/C-AVL-tree.asc
[appendix]
[[c-avl-tree]]
== AVL Tree
(((AVL Tree)))
(((Tree, AVL)))
AVL Tree is named after their inventors (**A**delson-**V**elsky and **L**andis).Search for .pdf for more instances.