B-Trees

• B-Tree is a self-balancing search tree
• To understand the use of B-Trees, we can think of a large amount of data that cannot fit in main memory
• The main idea of using B-Trees is to reduce the number of disk accesses

Used as Indexes for Heaps

https://www.youtube.com/watch?v=C_q5ccN84C8