AVL trees in 5 minutes - Deletions

[@mohsinshahbaz5846]

exam in 1 hour

[@SAFACTS]

same situation

[@koffeltuff1231]

Outside the hall

[@ayushvaze1622]

After exam preparing for re exam already knows result

[@Slothrave]

@@ayushvaze1622 yo i cheated of you....i got 0

[@akjunior1_]

Same situation

[@dandandan3675]

omg. tysm!!! please don't stop making these types of videos

[@riancmd]

Really concise and straight to the point. I'm reviewing for my exam today so this helped me a lot! Thank you.

[@mosahosseini63]

thank you so much for your video. I have a question, in you demonstration (0:42) you say that if the node we want to delete doesn't have a left child, we delete the node and move the right child in its place. However, in your pseudo code (4:25) , you create a variable to store the right child , and set the root to None and not to its right child. shouldn't it be: if not root.left: temp = root.right root = temp return temp I don't understand why the root should be None.

[@djamelbgd301]

straight to the point 🔥🔥🔥🔥🔥

[@Vincent-qh4rg]

Your videos are too good🐐

[@D3ebK]

🐐

[@baokhangnguyenbac7689]

Does that mean the rotation part just similar that we cannot make it a separate function which can use for both insertion and deletion?

[@typingcat]

01:24 What if that "in-order successor" has children? In the example, 125 had no children, so it was simple but what if 125 had children?

[@Harsh_Reveals]

In inorder successor we have to go to right subtree and go to its left most value

[@أبوجعفر-غ6ث]

Hi, I loved your video ! I'm watching you since a long time, I've seen almost all your videos about sort algorithms ( insertion, selection, bubble sort, etc.). I just wanted to ask, how do you make these ? I mean, what software do you use to make these videos ? and what material do you use ? Thank you very much for the answer and for the time spent.

[@MichaelSambol]

Thanks for the kind feedback! It's Keynote and iMovie.

[@أبوجعفر-غ6ث]

Thank you !@@MichaelSambol

[@nullptr.]

Tyvm! Out of curiosity, are you guys learning DSA in Python? my class is in C

[@MichaelSambol]

We did Java when I was in school. Depends on your college. I chose Python here because I think it's easiest to learn: github.com/msambol/dsa.

[@jaystar3990]

will this work if the node is the root?

[@davidphamle]

What happen if you delete root?

[@jaystar3990]

hey, im not familiar with python, what is the parameter'self' referring to?

[@MichaelSambol]

www.geeksforgeeks.org/self-in-python-class/

[@jaystar3990]

@@MichaelSambol thank you👍

[@tayyabsami258]

Cool man really helped alot

[@kazraven9086]

Can you make a video about Johnson's algorithm?

[@MichaelSambol]

Will add it to the list 👍🏼

[@kazraven9086]

Thanks! love your videos @@MichaelSambol

[@parasgujjar9147]

Exam in 2 hr

[@chudchadanstud]

It's all fun and games until you have to do it iteratively

[@hehexd5469]

you a goat fr

[@the3rdson]

Height is the number of edges, the height in your video is wrong

[@the3rdson]

You gotta double check your stuff my guy 😭, people could and probably have lost points because of that simple mistake...

[@MichaelSambol]

There are a few ways you can define it. I chose "the number of nodes on the longest path from the root to a leaf." As long as you are consistent, the balance factor will be the same.

[@the3rdson]

@@MichaelSambol I see, thanks for clarifying

[@shivammalviya2106]

Tommorow is exam

[@wawa_game]

exam in 20 Minutes