About this document
Understanding Threaded Binary Trees by Chandramouli Haldar is a document available to read on EtoBox.
Threaded binary trees replace empty child pointers with threads linking nodes to their inorder successors/predecessors, allowing inorder traversal without recursion or a stack. B-trees generalize binary search trees to allow more than two children per node, keeping the tree short while storing large numbers of keys. B+-trees are like B-trees but store data only in leaf nodes linked together.
- Author
- Chandramouli Haldar
- Language
- EN