AVL Tree 2 Nodes

[@PatrickAndFriendsPRO]

No class today fam, thank the lord dr. rob edwards. nice video

[@pasechnikpasechnik2235]

Hello, first of all I want to say thank you for the great lectures, I personally like them :). I have a question regarding the node class. If we don't store node's height value in the node, so we have to compute it when we CheckBalance of our tree. For example we have a big tree, inserted new node and did rotation close to leaves, now we have to check all parents until root if our tree is balanced. Runtime of height(node) = O(2^(node's height)) => runtime of CheckBalance and as a result Insertion and Deletion will take runtime of height(root) = O(n)? Or I miss something? Thanks a lot!

[@huonggiang4876]

I'm quite confused about how they film the video cause it looks like I watch his lesson through the glass board and we're in opposite direction, but I still can read all things he wrote in the right direction. I mean in that case, if he writes "right", I'll see "thgir" instead of "right" like in the video. So, I don't know where they located the camera :) But Thanks for all your great lessons anyway !

[@macios124]

I think they just flipped video horizontally, so we see mirror image of the original recording.