Tree Data Structure 1960-2026。Binary Search Tree BST 1960年代 (左<根<右・O(log n) 平均・O(n) 最悪skewed)・AVL Tree (Adelson-Velsky+Landis Soviet 1962・Self-balancing・Heightバランス±1・回転Rebalance Rotation)・Red-Black Tree (Rudolf Bayer 1972 Symmetric Binary B-Tree→Leonidas Guibas+Robert Sedgewick 1978命名・Java TreeMap+C++ std::map+std::set+Linux Kernel CFS Scheduler)・Splay Tree (Sleator+Tarjan 1985 Self-adjusting)・B-Tree (Bayer+McCreight 1972 Boeing研究所・DB Index+File System)+B+Tree (Leaves only Data)+B*Tree (Knuth)・Treap (Aragon+Seidel 1989 Random Priority)・Trie Prefix Tree (Edward Fredkin 1960・String検索)+Patricia Trie+Radix Tree+Adaptive Radix Tree ART (2013)・Skip List (William Pugh 1990・Random Linked List)・KD-Tree (Bentley 1975 Spatial)・LSM-Tree Log-Structured Merge (RocksDB+Cassandra+ScyllaDB)・¥0 標準, 2026年Red-Black+B+Tree+LSM-Tree主流 (DB+OS基盤)。