Re:How does database indexing work? (2008)
by programmarchy on Tuesday March 08, 2022 @12:07PM
(#30602370)
Right, I think you could say a binary tree is a kind of B-tree, though.
[ Parent
| on HN ]
Re:How does database indexing work? (2008)
by jlokier on Tuesday March 08, 2022 @02:42PM
(#30605496)
It's not, because in a standard B-tree all the leaf nodes are at exactly the same depth, whereas in a binary tree they are not in general, unless the binary tree is balanced with exactly 2N leaves.
This difference occurs because a B-tree can have interior nodes that aren't completely full, whereas a binary tree's interior nodes have exactly 2 children.