CMSC420-0201: Lecture - Shared screen with speaker view
What's the last run
mean for question 5?
Afe Peace Addeh
when getting the token amount can we do the limit m goes to infinity
For #5, can we assume that we start with an array of size 3?
What does an in-order traversal look like if a node has more than 2 children? When do we visit the node?
there isn't ne
What’s your favorite tree Dr.Mount? Mine is a Christmas tree
I went there for study abroad!!
this is magic
Afe Peace Addeh
can you go over last to lines again
What is n(h)
Russell William Schwartz
"n(h) denote the minimum possible number of nodes in binary tree ofheight h that satisfies the AVL balance condition"
Would the "rotation" change if we go, for example pre order?
Is there a reason the top node is shown as a right child in these examples?
Is there a reason to use LR vs RL other than the shape of the tree?
Isn't max height usually the root?
Yeah double rotation
When you'd use each
That last part was what I was wondering lol thanks
Is there any use of RR or LL rotation? like if c was the left child of b instead of right child
So after the "insertion (making a new node, and connect them...)" is done, we move back up and update height and check balance factor at each level?
can you explain how you got balance factor =-1 for b again (on the left tree)
isn't it possible for c to be 1 level deeper?
@Jane, because he just inserted a node into the A subtree (the +), A now has one additional element in comparison to C, so the balance factor (height of right - height of left) would be -1
then how did d's balance factor become -2?
1 - 3
cuz left became too heavy. at the root d, he balance-checked