Not many coding question content creators explain the concepts and solution so detailed like Steve does, appreciate that he takes his time to reiterate the "call stack" rather than saying "okay just repeat this for another n times and let's submit the code".
Very great content, this channel is one of a few youtube channels that explains the problems and solutions well in conjunction with clear and understandable visualizations.
I think this is the only video explains how the Inorder Traversal works and why it works like this. Other videos just do as the code but do not explain why.
Love it, man! You've earned a new subscriber for keeping the videos short, explaining things well, and walking through code while typing it. Incredible. You may not have many subscribers now, but I'm sure you'll eventually get traction!
Nice video! I don't know if you have ever considered this, but you might want to have a brighter light illuminating you for the pictures of you that you use in your thumbnails, as that might attract more clicks on your videos! (At least that's what I see most other TH-camrs doing) Cheers
What would the input array look like for the example you provided? (1, 2, 3, 4, null, 5, null, null, 6, null, null)? This would be reading left to right, row by row until you run out of parent nodes. Is there a set of rules that dictates how the root of a binary tree should look?
Not many coding question content creators explain the concepts and solution so detailed like Steve does, appreciate that he takes his time to reiterate the "call stack" rather than saying "okay just repeat this for another n times and let's submit the code".
Glad you liked it!
Left! Node! Right! Left! Node! Right!
Thank you so much)
You got it!
Great explanation of trees! This is a structure I was having a hard time understanding and this video helped me actually understand!
Glad it was helpful!
Thank you for the detailed explanation!
Glad it was helpful!
Very great content, this channel is one of a few youtube channels that explains the problems and solutions well in conjunction with clear and understandable visualizations.
Much appreciated!
Simple and clear. That's a great job man, keep doing it!
Thanks, will do!
I have not seen this kind of detailed explanation before
Thank you so much for walking us through iterative solutions! Most resources only cover a recursive strategy: your videos are so detailed and helpful!
Glad it was helpful!
Excellent explanation thanks
The best explanation i found. Thank you!
Glad it was helpful!
OMG THANK YOU YOU HELPED ME A LOT!🥰🥰
I'm so glad!
really great explanation
Glad it was helpful!
this is honestly so helpful and easy to understand! Your video is great
Glad it was helpful!
I think this is the only video explains how the Inorder Traversal works and why it works like this. Other videos just do as the code but do not explain why.
Glad you found it helpful!
best video perfect explanantion for approach
Glad you liked it
beautiful video, thanks
Many thanks!
Love it, man! You've earned a new subscriber for keeping the videos short, explaining things well, and walking through code while typing it. Incredible. You may not have many subscribers now, but I'm sure you'll eventually get traction!
Thanks for the sub and encouragement! Glad it helped! :)
Very clear, thank you
Glad it was helpful!
Best solution! #1!
Clear and great explanation, smooth logic! Thank you!
Glad it was helpful!
十分感谢❤❤❤
You are welcome!
Great explanation!
Glad it was helpful! Thanks!
clearest explanation, Thank u.
Glad it was helpful!
Thank you very much for your video, please keep doing it!!
Will do!
Thank you so much
You're most welcome
Good explanation to help me understand the solution. Thanks!
Glad it helped!
Clear explanation, thank you.
Glad it was helpful!
Beautiful explanation ❤️
Glad you liked it
Nice video!
I don't know if you have ever considered this, but you might want to have a brighter light illuminating you for the pictures of you that you use in your thumbnails, as that might attract more clicks on your videos! (At least that's what I see most other TH-camrs doing)
Cheers
That's a great idea! Thanks!
Wooow Thank you so much
You're welcome 😊
gently touched the like button so u can start uploading again :(
Thank you so much!
What would the input array look like for the example you provided? (1, 2, 3, 4, null, 5, null, null, 6, null, null)? This would be reading left to right, row by row until you run out of parent nodes. Is there a set of rules that dictates how the root of a binary tree should look?
Good explaination, thank you!
Glad you enjoyed it!
thnx,basic and helpful
Thank you
You're welcome!
Great work!!!!!!!
Thank you! Cheers!
good explanation
Thanks and welcome
谢了
nice sir
Thanks and welcome
I think at @2:00 you meant (LIFO) not (FIFO) as queue is FIFO.
👌👌👌👌