Hey everyone thank you so much for the support and continued growth of the channel. I try my best to make these videos super easy to follow. However, while they look short (< 25 mins), they take hours upon hours to create, animate, and voice over. So it would mean a lot if you can share these videos with others. Hope you all enjoy :)
Thank you so much for your time and effort! You not only illutrstate heaps clearly, the animations your made are also neat and beautiful! Really helps me a lot for understand this data structure!
Hey bro thanks for the videos, honestly this has to be THE best coding channel i have seen!! If you have time could you also possibly create videos for sorting algorithms such as merge sort, quicksort, insertion etc?
Thank you! You've literally read my mind. 😂 I was planning to create videos on bubble sort, selection sort, insertion sort, radix sort, quick sort and merge sort after finishing up Graphs.
Thank you, Lucas! I'm working on some other things right now, but it looks like sorting videos are something people want, so I will spend some time each day working on a "Sorting Video" that would cover all the major sorting algorithms instead of separate videos.
Hi Thanh, you would use the bounds of array to determine the validity of a subtree. The key thing to grasp is that the complete binary tree is simply a visual representation of the array. The 0th index can be visualized as the root & the n-1th index can be visualized as the rightmost node on the last level. Hope this helps :)
Hey everyone thank you so much for the support and continued growth of the channel. I try my best to make these videos super easy to follow. However, while they look short (< 25 mins), they take hours upon hours to create, animate, and voice over. So it would mean a lot if you can share these videos with others. Hope you all enjoy :)
Can’t appreciate your vids enough
Thank you so much, Dark Invader! Feel free to share these videos with you friends as it really helps out the channel.
Thank you so much for your time and effort! You not only illutrstate heaps clearly, the animations your made are also neat and beautiful! Really helps me a lot for understand this data structure!
Thank you for such a kind comment!! Please do share this content with your friends or on social media as it will really help the channel to grow.
Thank you so much bro these codes are the most readable codes ı have ever seen !
Thank you so much! Please don't forget to like and share as it will help the channel to grow.
Thanks! This is the clearest explanation I got by far. Clearer than even Leetcode
Thank you!! Please don't forget to share / recommend the channel to others as it will the channel to grow.
Hey bro thanks for the videos, honestly this has to be THE best coding channel i have seen!!
If you have time could you also possibly create videos for sorting algorithms such as merge sort, quicksort, insertion etc?
Thank you! You've literally read my mind. 😂 I was planning to create videos on bubble sort, selection sort, insertion sort, radix sort, quick sort and merge sort after finishing up Graphs.
Thank you so much! Every part is incredibly well explained.
Thanks a lot! Don't forget to Like and share as it helps the channel grow.
Great tutorial bro. i really learn from your videos. we want moreeee :D
Thanks vasili! I very much appreciate it! :)
Super helpful! Very well done!
I'm glad it helped, Lee Paolucci! :)
Great explanation! Thank you for your time.
Thanks a lot! Thank you for your time!! Please don't forget to share / recommend the channel on social media to help it grow.
Thank you very very much !!
Very underrated
Keep it up!
Thank you for the kind comment, Ferdous! :)
Cool! much appreciated!
Glad you found it helpful. If you have, please don't forget to like and share as it will help the channel grow.
hey man, great video. just a quick note, the timestamps are slightly off
Thanks, noted! Please don't forget to like and share if you found the content helpful.
Really enjoyed the content and the design of the board, could you do some videos(or do you have) about quick sort and merge sort?
Thank you, Lucas! I'm working on some other things right now, but it looks like sorting videos are something people want, so I will spend some time each day working on a "Sorting Video" that would cover all the major sorting algorithms instead of separate videos.
Cool 😎
Thanks 😎. Don't forget to like and share if you found the content helpful.
This is really good man
Thanks, Dev!
how do you check if the left subtree or right subtree are valid trees? (only use array interface) Thank you
Hi Thanh, you would use the bounds of array to determine the validity of a subtree. The key thing to grasp is that the complete binary tree is simply a visual representation of the array. The 0th index can be visualized as the root & the n-1th index can be visualized as the rightmost node on the last level. Hope this helps :)
thank you!
Thank you for watching! Please don't forget to like and share.