Course contentsShow
Computer Science
Lesson 1678 of 2,87238. Database Transactions and IndexingPro lesson

B-Tree vs Binary Search Tree

Why B-Trees use multiple keys per node and how this optimizes disk I/O operations.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.