16 lines
713 B
Plaintext
16 lines
713 B
Plaintext
In-class discussion
|
|
|
|
Discuss the following questions with students around you.
|
|
|
|
1. To implement and manage the B+ tree, 4 major functions will need to be implemented, what are they?
|
|
|
|
2. Each node on a B+ tree stores up to b-1 keys, in this program, What should be the key? And how do we associate the key with the products?
|
|
3. How exactly do we insert a new key to the B+ tree?
|
|
4. When to split nodes? And how to split nodes?
|
|
|
|
5. What shall we do in the main function?
|
|
|
|
6. Once all products are stored in the B+ tree, how exactly do we find the products whose price falls into the search range?
|
|
|
|
7. There are 2 types of nodes on a B+ tree, leaf node vs internal node. Do we need to handle them in different ways?
|