CMSC420-0201: Lecture - Shared screen with speaker view
up to what material will the exam cover
Will we ever go over any kind of graph related data structure?
is it possible to cut the material for the exam a week before the exam?
that way we have more time to do hw2 and study?
does programmer set what M is?
is nChild= M?
The tree drawing does looks like a truck somehow
when do you do merge vs adoption
seems like both done when two few children
why did you "split" right after inserting 29?
wouldn’t the root have 26 and 49 instead of 49 and 26?
left as an exercise on an exam
why did you do adoption not merge?
Next thing there's an A- tree
what does the rightmost external node's "next" point to?