B-Trees

This is a visual representation of a B-Tree

What is a B-Tree?

• A B-Tree is a Balenced Tree that is able to hold large amounts of data.
• A B-Tree has nodes that can hold multiple keys, making the tree more shallow and have a larger branching factor

B-Tree Properties

• Search Tree
• Height H = logmN, with N: number of nodes, m: branching factor
• Self-balancing

For More Information Visit The Link Below

Geeks for Geeks: B-Trees