1.7 Binary Search Trees
BST operations, traversals, augmentation, interval trees, order statistics, persistence, and thread-safe BST designs.
1.7 Binary search trees, 45
| index | slug | name |
|---|---|---|
| 1 | binary-search-tree | Binary Search Tree |
| 2 | bst-insert | BST Insert |
| 3 | bst-delete | BST Delete |
| 4 | bst-search | BST Search |
| 5 | bst-minimum | Minimum |
| 6 | bst-maximum | Maximum |
| 7 | bst-predecessor | Predecessor |
| 8 | bst-successor | Successor |
| 9 | bst-height | Height |
| 10 | bst-depth | Depth |
| 11 | bst-traversal-inorder | Inorder Traversal |
| 12 | bst-traversal-preorder | Preorder Traversal |
| 13 | bst-traversal-postorder | Postorder Traversal |
| 14 | bst-level-order | Level Order |
| 15 | bst-iterative-traversal | Iterative Traversal |
| 16 | bst-recursive-traversal | Recursive Traversal |
| 17 | bst-balance-check | Balance Check |
| 18 | bst-degenerate-case | Degenerate Tree |
| 19 | bst-construction | Construction |
| 20 | bst-from-sorted-array | Sorted Build |
| 21 | bst-serialization | Serialization |
| 22 | bst-deserialization | Deserialization |
| 23 | bst-range-query | Range Query |
| 24 | bst-kth-smallest | Kth Smallest |
| 25 | bst-kth-largest | Kth Largest |
| 26 | bst-lowest-common-ancestor | LCA |
| 27 | bst-validate | Validate BST |
| 28 | bst-merge | Merge Trees |
| 29 | bst-split | Split Tree |
| 30 | bst-rotate-left | Rotate Left |
| 31 | bst-rotate-right | Rotate Right |
| 32 | bst-join | Join Trees |
| 33 | bst-copy | Copy Tree |
| 34 | bst-clone | Clone Tree |
| 35 | bst-iterator | Iterator |
| 36 | bst-threaded | Threaded BST |
| 37 | bst-augmented | Augmented BST |
| 38 | bst-interval-tree | Interval Tree |
| 39 | bst-order-statistic | Order Statistic Tree |
| 40 | bst-persistent | Persistent BST |
| 41 | bst-concurrent | Concurrent BST |
| 42 | bst-lock-free | Lock Free BST |
| 43 | bst-cache-aware | Cache Aware BST |
| 44 | bst-memory-layout | Memory Layout |
| 45 | bst-invariant-check | Invariant Check |