B-Tree Data Structure

From GM-RKB
(Redirected from B-tree)
Jump to navigation Jump to search

A B-Tree Data Structure is a tree-based data structure where internal (non-leaf) nodes can have a variable number of child nodes within some pre-defined range.



References

2013