AVL Tree implementation in C++20.
AVL
,Naive
binary search tree implementationsOrderedSet
parametrized byBST
typeIndexedOrderedSet
withO(logn)
kth element method- BST Node contains payload that is computed from its children
- Common algorithms:
Search
,Min/Max
,Lower/Upper Bound
,Successor/Predecessor