CODEWITHSUNDEEP
data-structuresb-tree
user541686
user541686

Reputation: 210755

What's a B*Tree?

What's a B*Tree? Did they just mean binary search tree?

Upvotes: 7

Views: 3860

Answers (2)

dlev
dlev

Reputation: 48596

Nope. Note that the * indicates the nodes are at least 2/3 full.

Upvotes: 5

erickson
erickson

Reputation: 269857

No. A node in a B*Tree can have many keys (which point to many children). They operate by comparing keys in order to select a child node, much like a binary tree. But, the intent is that each node is stored on disk, and can be read into memory at once. Thus, the number of disk accesses required would match the depth of the tree.

Upvotes: 3

Related Questions