| Segment Tree | Tree over array segments | Range queries | Interval sums | Range-based | Tree-based | Static or dynamic |
| Interval Tree | Stores intervals | Overlap queries | Scheduling | Interval-based | Tree-based | Augmented BST |
| Range Tree | Multi-dimensional range tree | Orthogonal queries | Geometry | Multi-key | Tree-based | High memory |
| Bin | Simple spatial bucket | Coarse partitioning | Spatial hashing | Bucket-based | Contiguous | Very basic |
| K-d Tree | K-dimensional BST | Axis-aligned splits | Nearest neighbor | Spatial | Tree-based | Static datasets |
| Implicit K-d Tree | Array-based k-d tree | No pointers | Space efficiency | Spatial | Contiguous | Cache-friendly |
| Min/Max K-d Tree | Stores bounds per node | Faster pruning | Spatial queries | Spatial | Tree-based | Optimization |
| Relaxed K-d Tree | Looser balancing | Easier updates | Dynamic datasets | Spatial | Tree-based | Less strict |
| Adaptive K-d Tree | Self-adjusting splits | Data-aware | ML, clustering | Spatial | Tree-based | Distribution sensitive |
| Quadtree | 2D space split into 4 | Recursive partition | GIS, graphics | Spatial | Tree-based | 2D only |
| Octree | 3D quadtree | 8-way partition | 3D graphics | Spatial | Tree-based | 3D space |
| Linear Octree | Linearized octree | Compact storage | Spatial indexing | Spatial | Contiguous | Morton codes |
| Z-order | Space-filling curve | Preserves locality | Databases | Linearized | Contiguous | Morton order |
| UB-tree | B-tree + Z-order | Multidimensional indexing | Databases | Key-based | Node-based | Space-filling |
| R-tree | Bounding rectangles | Spatial indexing | GIS | Region-based | Node-based | Disk-friendly |
| R+ Tree | Non-overlapping nodes | Faster search | Spatial DBs | Region-based | Node-based | Costly splits |
| R* Tree | Optimized R-tree | Better node packing | Spatial DBs | Region-based | Node-based | Industry standard |
| Hilbert R-tree | Hilbert ordering | Improved locality | Spatial indexing | Linearized | Node-based | Space-filling |
| X-tree | High-dimensional R-tree | Avoids overlap | Data mining | Region-based | Node-based | Large nodes |
| Metric Tree | Distance-based tree | Metric spaces | Similarity search | Distance-based | Tree-based | Non-Euclidean |
| Cover Tree | Nested covers | Fast NN search | ML, clustering | Distance-based | Tree-based | Scales well |
| M-tree | Metric index | Dynamic metric data | Multimedia DBs | Distance-based | Node-based | Disk-friendly |
| VP-tree | Vantage-point splits | Metric partitioning | Similarity search | Distance-based | Tree-based | Static data |
| BK-tree | Edit-distance tree | Approx string match | Spell checkers | Distance-based | Tree-based | Discrete metrics |
| Bounding Interval Hierarchy | Interval bounds tree | Range pruning | Collision detection | Hierarchical | Tree-based | Physics engines |
| Bounding Volume Hierarchy | Volume-based hierarchy | Fast collision tests | Ray tracing | Hierarchical | Tree-based | Graphics staple |
| BSD Tree | Binary space decomposition | Recursive partition | Rendering | Spatial | Tree-based | Scene graphs |
| Rapidly Exploring Random Tree | Random growth tree | Path planning | Robotics | Exploratory | Tree-based | Motion planning |