My DS prof couldn't teach even if his life depended on it. He came to the class with a stack of yellowed notes, copied that onto the blackboard, and read from the notes when asked a question. If you skipped his class, he'd find a way to give you low grades in his papers. Mind that I graduated from one of the top universities in the country. Can you imagine how many futures this f* guy ruined?
Really enjoy watching your videos, learnt a lot of things and a nice thing I would like to mention is the code quality, one function only do one thing even the logic can be written in one line, which make the code much more readable.
I have a question here 8:27 Still didn't get the idea why removing the leaf- checking base case is ok? I think the statement of "correcting tree height" is not convincing.
What I don’t understand if you could please explain is why h-1 is used on every subtree, so for example, x root, go right have a z node, left of z node is another Y node, left of the Y node we have just a triangle (working on double rotation) which has a height of h-1, right of the Y node we have another triangle which has the height of h-2, right of Z node we have a triangle which is again h-1. Left of root x we have one triangle that is h-1, now where do these h-2 and h-1 come from. Also when checking the imbalance, a h+1 comes in to make it an imbalance of 2. How does this work, I can’t wrap my head around it. PLEASE HELP
Hi William, in the leafSum algorithm, you have one with the nodes with three children. I am assuming we would be using an adjacency list to store this tree. Please correct me if we have to do it differently.
Hi William I have access to my company udemy account. I already bought the Graph Theory Algorithms course. However, I am not able to access the Easy to Advanced Data Structures. I guess it due to this course is different category which is not covered by my company. Would you be able to create a copy of "Easy to Advanced Data Structures" under "IT & Software Other IT & Software Algorithms", I believed many users are also facing the same issue. I can provide more details if requires. Hope you can help. Thanks.
What I don’t understand if you could please explain is why h-1 is used on every subtree, so for example, x root, go right have a z node, left of z node is another Y node, left of the Y node we have just a triangle (working on double rotation) which has a height of h-1, right of the Y node we have another triangle which has the height of h-2, right of Z node we have a triangle which is again h-1. Left of root x we have one triangle that is h-1, now where do these h-2 and h-1 come from. Also when checking the imbalance, a h+1 comes in to make it an imbalance of 2. How does this work, I can’t wrap my head around it. PLEASE HELP
I'm sure you've heard this a lot before,but I must say that you teach a lot better than my DS professor. Keep up the good work,and stay safe!
Glad to help!
My DS prof couldn't teach even if his life depended on it. He came to the class with a stack of yellowed notes, copied that onto the blackboard, and read from the notes when asked a question. If you skipped his class, he'd find a way to give you low grades in his papers. Mind that I graduated from one of the top universities in the country. Can you imagine how many futures this f* guy ruined?
This playlist will pass the test of time.
Appreciate the calmness of your voice.
Your videos are so well explained and easy to understand. Thanks for providing us such a high quality material
I don't do Java, so I really love that code is in pseudo
It's not in Java :)
Really enjoy watching your videos, learnt a lot of things and a nice thing I would like to mention is the code quality, one function only do one thing even the logic can be written in one line, which make the code much more readable.
Good to notice a video of recent time.. Thats some nostalgic music in the beginning! :) Thanks for making these great videos..
up
really enjoying this playlist during quarantine!
always high quality!
Hi William, Great videos! Really informative. Can you please share about how you create video slides?
With Keynote:
github.com/williamfiset/Algorithms/tree/master/slides
Sir I follow ur every video
I have a question here 8:27
Still didn't get the idea why removing the leaf- checking base case is ok?
I think the statement of "correcting tree height" is not convincing.
What I don’t understand if you could please explain is why h-1 is used on every subtree, so for example, x root, go right have a z node, left of z node is another Y node, left of the Y node we have just a triangle (working on double rotation) which has a height of h-1, right of the Y node we have another triangle which has the height of h-2, right of Z node we have a triangle which is again h-1. Left of root x we have one triangle that is h-1, now where do these h-2 and h-1 come from. Also when checking the imbalance, a h+1 comes in to make it an imbalance of 2. How does this work, I can’t wrap my head around it. PLEASE HELP
Great video! This channel gives me 3blue1brown vibes.
These videos are amazing!!
Thanks for the amazing video!
Awesome videos!!!🔥🔥
William must have a good taste of music. ;)
For the first problem, does it means that only rooted trees have leaves? Otherwise how can you traverse from a root node?
Greate Job! Thank you!
Big Like! Thank you
Hi William, in the leafSum algorithm, you have one with the nodes with three children. I am assuming we would be using an adjacency list to store this tree. Please correct me if we have to do it differently.
Please watch ua-cam.com/video/1XC3p2zBK34/v-deo.html, essentially we have a rooted tree and each node has a reference to a list of all its children.
Hi William I have access to my company udemy account. I already bought the Graph Theory Algorithms course. However, I am not able to access the Easy to Advanced Data Structures. I guess it due to this course is different category which is not covered by my company. Would you be able to create a copy of "Easy to Advanced Data Structures" under "IT & Software
Other IT & Software
Algorithms", I believed many users are also facing the same issue. I can provide more details if requires. Hope you can help. Thanks.
couldn't you just loop through the nodes and sum up the values of the nodes whose out degree is 0?
code was written by python?
It's pseudo-code but very close to python syntax
2:01
Forgot to add 7?
7 is not a leaf node, it has a child
@@interstella5555 oh... made a mistake. Thanks
What programming language is this?
Looks like python
Actually it looks like he's copied your whole set of videos into a "course".
Can I marry you?
wowwwww
What I don’t understand if you could please explain is why h-1 is used on every subtree, so for example, x root, go right have a z node, left of z node is another Y node, left of the Y node we have just a triangle (working on double rotation) which has a height of h-1, right of the Y node we have another triangle which has the height of h-2, right of Z node we have a triangle which is again h-1. Left of root x we have one triangle that is h-1, now where do these h-2 and h-1 come from. Also when checking the imbalance, a h+1 comes in to make it an imbalance of 2. How does this work, I can’t wrap my head around it. PLEASE HELP