| B-tree | Multi-way balanced search tree | All leaves at same level | Databases, filesystems | Logarithmic | Node-based | Disk-friendly |
| B+ Tree | Data only in leaves | Linked leaf nodes | Database indexing | Logarithmic | Node-based | Fast range queries |
| B* Tree | Optimized B+ tree | Higher node utilization | Large indexes | Logarithmic | Node-based | Fewer splits |
| 2–3 Tree | Nodes have 2 or 3 children | Strict balance | Educational use | Logarithmic | Node-based | Simple B-tree |
| 2–3–4 Tree | Nodes have up to 4 children | Red-black equivalent | Teaching, indexes | Logarithmic | Node-based | Always balanced |
| Dancing Tree | Adaptive B-tree | Dynamic restructuring | Research systems | Logarithmic | Node-based | Rarely implemented |
| Queap | Queue + heap hybrid | Supports min queries | Sliding window | Amortized log | Node-based | Specialized use |
| Fusion Tree | Word-level parallelism | Sub-logarithmic search | Theoretical CS | O(log n / log w) | Node-based | Complex to implement |
| Bx-tree | B-tree for moving objects | Time-parameterized keys | Spatial databases | Logarithmic | Node-based | Handles motion |