Zoom Logo

CMSC420-0201: Lecture - Shared screen with speaker view
William Cao
14:13
how much public/release/private tests
Jane Li
15:32
Can we run the sample tests you gave us if junit testing hasn't been set up?
Sonya Radichkova
53:12
Aren’t you still checking for nil anyways?
Chandan Murthy
01:05:00
Is it also possible that d is the right child of the ? node
Samantha Tang
01:05:07
Would this require a skew restructuring after? Based on the way you drew it?
Olayemi Oyindamola Ajayi
01:05:14
^
Tuan Le
01:07:50
you also have to check the equality for the left side too right?
Zijian Zhang
01:09:22
Why is the red node chain bad again?
Zijian Zhang
01:10:11
So the red chain only appears after doing other operations
Zijian Zhang
01:10:14
say a deletion
Zijian Zhang
01:10:31
okay thanks
Jane Li
01:13:19
can you have red-red link childs on left and a red on right of p? if so how do you resolve this?
Jane Li
01:15:14
so can never have red-red on the left or one red on the right?
Chandan Murthy
01:19:41
so since you insert one at a time, there would never be a case where you have a red-red left child
Sonya Radichkova
01:20:54
So the skew and split steps are specifically referring to when you’re inserting an element?
Zijian Zhang
01:21:15
Why we don't like left red node? It is still a valid red black tree right?
Jane Li
01:21:28
so the only cases you can get is 1 red child on the left or a red-red child on the right (which will be resolved with a skew/split)?