CMSC420-0201: Lecture - Shared screen with speaker view
Rivest is one of the authors of the algorithm textbook we use in CMSC351 lol
isn't an issue
where ur close to m> 2n consistenly
and you just keep rebuilding when you don't have to?
I just stepped out for a moment... sorry but what does the O(k) standfor?
O(number of elements)
so "if size(p.child)/size(p) > 2/3" is asking "are the children balanced?"
to calculate "d", we just add everytime we go down during the insertion process?
So you just literally walk down the tree and count them one by one?
for finding the size(p), can't we just have an instance variable of "size" for each node and everytime a node knows a new node has just passed down the tree, we increment size...? just an idea