Zoom Logo

CMSC420-0201: Lecture - Shared screen with speaker view
Hyen Jeong
21:11
Rivest is one of the authors of the algorithm textbook we use in CMSC351 lol
William Cao
28:23
isn't an issue
William Cao
28:30
where ur close to m> 2n consistenly
William Cao
28:39
and you just keep rebuilding when you don't have to?
Hyen Jeong
33:50
I just stepped out for a moment... sorry but what does the O(k) standfor?
William Cao
34:34
O(number of elements)
Hyen Jeong
43:29
so "if size(p.child)/size(p) > 2/3" is asking "are the children balanced?"
Hyen Jeong
46:50
to calculate "d", we just add everytime we go down during the insertion process?
Hyen Jeong
46:59
d++
Hyen Jeong
51:09
So you just literally walk down the tree and count them one by one?
Hyen Jeong
01:13:10
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