B-tree insertion, splitting and search: Examples & Code
B-tree insertion, splitting and search: Build a minimum-degree-two B-tree by splitting full nodes before descending. Each node holds one to three keys, and…
Explore algorithm visualizations code snippets and tutorials
B-tree insertion, splitting and search: Build a minimum-degree-two B-tree by splitting full nodes before descending. Each node holds one to three keys, and…
Trie insertion, prefix search and deletion: Share letter prefixes between words, count unique words below each node, and prune a deleted word only when its…
AVL tree insertion and rotations: Maintain subtree heights and repair left-left, left-right, right-right and right-left imbalance with rotations. Duplicate…
Red-black tree insertion and deletion: Use a left-leaning red-black tree: rotate red links, split temporary 4-nodes, and move red links downward before…
Hash table double hashing: Insert keys, delete a key, insert another key, then search. Resolve collisions by double probing; tombstones preserve search paths.…