Implement a B+-tree.
Here are some details.
["Perryridge"] ["Downtown", "Mianus"] ["Redwood"] ["Brighton", "Clearview"] ["Downtown"] ["Mianus"] ...(The ... indicates that there's more on this line, I'm just leaving it out for brevity.) Note that I chose this example because it was in your textbook; but for your B+-tree, this should contain integers.
import bptree b = Bptree(5) #<-- each node has 5 keys, and thus 6 pointers b.insert(12,"hello") b.insert(24,"bye") print b.getValue(24) b.printTree()