Self Balancing Tree
Everything on SkillVeris tagged Self Balancing Tree — collected across the glossary, study notes, blog, and cheat sheets.
2 resources across 1 library
Interview Questions(2)
What is a B-Tree?
A B-tree is a self-balancing, multi-way search tree where each node can hold multiple keys and multiple children, keeping the tree shallow so search, insert, a…
What is a Splay Tree?
A splay tree is a self-adjusting binary search tree that moves any node accessed — via search, insert, or delete — to the root using a sequence of rotations ca…