Week 6: B-Trees Flashcards
1
Q
What is a B-Tree? What are the properties?
A
2
Q
What is the max height of a B-Tree?
A
3
Q
How does the put() method work for B-Trees? What is the algorithm?
A
4
Q
What is the time complexity of the put() method for B-Trees?
A
5
Q
How does the remove method for B-Trees work? What is the algorithm?
A
6
Q
What is the time complexity of the remove() method for B-Trees?
A
7
Q
What is the difference between an AVL Tree and a B-Tree?
A
›
8
Q
What is the memory Hierarchy? What does it have to do with the difference between an AVL Tree and a B-Tree?
A
