Tree data structures

Lessons in this group, roughly in build order:

• avl-trees — A self-balancing binary-search-trees that keeps the height of every node’s two subtrees within 1,…
• b-trees — A balanced, multi-way search tree where every node holds many keys and children, designed to minimize…
• 2-3-trees — A balanced search tree where every internal node has either 2 children and 1 key or 3 children and 2 keys,…
• red-black-trees — A self-balancing binary-search-trees that colors each node red or black and enforces color rules so the…
• isam — Indexed Sequential Access Method: a disk file organization with a static, sorted multi-level index over…
• indexing — An auxiliary data structure that maps key values to record locations so lookups avoid scanning every row,…