B-tree
A self-balancing, tree-based data structure, that allows read/write access in logarithmic time / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about B-tree?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
Not to be confused with Binary tree or B+ tree.
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children.[2] Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems.
Quick Facts Type, Invented ...
B-tree | ||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Type | Tree (data structure) | |||||||||||||||||||||||
Invented | 1970[1] | |||||||||||||||||||||||
Invented by | Rudolf Bayer, Edward M. McCreight | |||||||||||||||||||||||
|
Close