Week 5: 2,4 Trees Flashcards
1
Q
What is a (2,4) Tree? What are its properties?
A
2
Q
What is the height of a (2,4) Tree?
A
3
Q
How does insertion work for (2,4) Trees?
A
4
Q
How is overflow handled in (2,4) Trees?
A
5
Q
What is the algorithm for put() for a (2,4) Tree?
A
6
Q
How does deletion work for (2,4) Trees?
A
7
Q
What is Underflow and Fusion? What is its case?
A
8
Q
What is Underflow and Transfer? What is its case?
A
9
Q
What is the algorithm for remove() for an (2,4) Tree?
A
10
Q
What are the complexities for the following with regards to (2,4) Trees?
put()
remove()
A
put() is O(log n)
remove() is O(log n)
