Hi all, I'm having difficulties with a past paper question on B+ Tree's that I need to fully understand for an exam 2 weeks from now. Any help would be appreciated!
I need to construct a B+ tree with branching factor M = 3. Each leaf can contain up to L data items, where L = M. Draw the B+ tree after insertion of 2, 9, 3, 8, 5, and 6 (in the given order).
Firstly can anyone tell me what M and L are abbreviations for? And can anyone direct me to any helpful tutorials or guides on how to do B+ Trees? I'd really like to know how to do these!