Loving this DSA course. Had in college, but it is always good to refresh my mind. Also I learned DSA in C, so it's interesting to watch python implementations of it.
Thank you so much for taking the time and putting so much effort into creating this course. I am learning DSA for the first time and your videos are amazing!!
hey greg, this playlist has been super helpful so far, I hope you will cover other DSA like backtracking, greedy, bit manipulation in the future videos.
Hello Greg I love your video and solve many problems on leetcode i want you to make videos on A complete path for a python developer with the best resource you recommend to a beginner. And a complete study plan. as In TH-cam there are lots of videos that Miss lead the info. I hope you found this comment relevant and made a video so I can share it with college friends. So they can start coding instead of watching tons of tutorials. ❤❤❤
Yes it is neither a complete nor perfect tree; definition of complete tree is all the levels but last one (leaves) must be filled with max # nodes (2^(0-indexed level)). Further, definition of perfect tree requires max amount of leaf nodes to be present as well.
Master Data Structures & Algorithms For FREE at AlgoMap.io!
Thanks bro, to my mind, honestly your videos are better than Harvard's cs50 course🤝🤙
Loving this DSA course. Had in college, but it is always good to refresh my mind.
Also I learned DSA in C, so it's interesting to watch python implementations of it.
Sorry for the slow reply, that's awesome!!
Thank you so much for taking the time and putting so much effort into creating this course. I am learning DSA for the first time and your videos are amazing!!
Very clear and on point explanation 🎉
Thanks brother your videos always make any tough topic so much easy ❤
@@zoroxak0172 glad to hear it!
hey greg, this playlist has been super helpful so far, I hope you will cover other DSA like backtracking, greedy, bit manipulation in the future videos.
Yes I will and glad to hear it :)
wth man, I have been looking for a python dsa course since months, and i here it is!
All of your videos are amazing! I learnt a lot from you. Thank you so much for putting in the effort!
Best video till today ❤
Woot!
I needed this, thanks for sharing knowledge and you efforts
My pleasure:)
Great Content Greg 👏👏
One of my favorite channels ❤
Glad to hear it!
Amazing explanation!
A wise programmer once said "learn trees, and it will bear you fruit of knowledge"
Who said that 😂
@@GregHogg a wise programmer.
@@asagiai4965 ah of course 😂
@GregHogg 😆 nice topic though. Trying to cover almost everything about the Tree DS amd the common functions included.
Awesome explanation, I'm glad I found your channel. Thanks a lot for sharing your knowledge with us.
You're too sweet
Amazing vids bro!
Thanks for the video Greg, appreciate it! 🙌
No problem!
Thank You!
If I understand correctly, there is a difference between a full tree and a complete tree, correct?
TYSM
Hello Greg I love your video and solve many problems on leetcode i want you to make videos on A complete path for a python developer with the best resource you recommend to a beginner. And a complete study plan. as In TH-cam there are lots of videos that Miss lead the info. I hope you found this comment relevant and made a video so I can share it with college friends. So they can start coding instead of watching tons of tutorials. ❤❤❤
At timestamp 4:18, if we were to have a node.left for node 3 added, would that be considered neither a complete nor a perfect tree (incomplete tree)?
Yes it is neither a complete nor perfect tree; definition of complete tree is all the levels but last one (leaves) must be filled with max # nodes (2^(0-indexed level)). Further, definition of perfect tree requires max amount of leaf nodes to be present as well.
What software did you use for drawing?
Any chance you could go over the insertion and deletion of a node in a binary search tree?
Are you also going to make a few videos on self balancing trees such as AVL, Red Black and Splay tree etc?
😢😢😢 didn't really understand it much , yet finished video in hope of learning it