@malikrumi1206
Ok, this video is two years old, and you've moved on to a lot of other things. But I just want to point out - because I've searched - while there are plenty of so-called tutorials about binary trees, there is almost nothing about general trees. I get it, people always want to take the easiest option, even if that doesn't really help their followers in the long run - or the short run, for that matter, because they quickly find out that too simplistic tutorials don't get you very far in the real world. So this is an appreciation, and a thank you, for the thoroughness and completeness of your work, and your interest in actually helping people learn what they need to know.
@sukurcf
The best thing about your videos is that you provide a real world example for every data structure that we are going to discuss.
@souvikmitra2652
sir , I had my computer teachers in my college . But you are the one who actually taught me the Data Structure concepts and made me think why they were important and why we need to do know it . Some teachers sometimes dont know , how critical their roles are in some one life . Happy Teachers day to you even though today is not the teacher's day
@PaulinhoOsfaya1
hahahahahahaah "if you directly look the solution, I gonna inject corona virus in your computer!" Dude, I laughed so hard! Awesome!
@shellysinha5429
Write a function called searchBFS which given the tree or graph as defined below returns every number smaller than 4 in the order it was found using the breadth first technique.
@carzycults6119
I compiled the code without maintaining parent link it worked fine for traversing from root to leaf node
@kacjugr
I often find that writing iteration-over functions in the same space as recursion-into functions can cause people a ton of issues with understanding. Instead, you could also write get_level() recursively like this:
def get_level():
if not self.parent:
return 0
else:
return self.parent.get_level() + 1
@MilahnMartin
Watching this is 2021 for my Software Engineering's degree and man you are awesome ! Thank you for this awesome video !
@vileider
21:48 XD XD. Like I would hear myself sometimes. You have got my like for it.
@d25102
genuinely one of the most helpful tutorial series on this website! thank you!
@narinpratap8790
Bro this is awesome! Your DS & Algo tutorials are so easy to understand and they also cover the fundamentals very well. Thanks so much for doing this :D
@justbewithme2009
I recently completed my MS in engineering in US. Have been learning python specifically to enhance my ML skills. Your videos have been really helpful. Appreciate your efforts.
@anuvind_m
For printing levels, I found a much better and easy implementation. Hope this helps!
def printTree(self, level=0):
indent = " " * level
if level==0:
print(self.data)
else:
print(indent +"|__"+ self.data)
if self.children:
for child in self.children:
child.printTree(level + 1)
@simpletermsexplained
Thank you #codebasics, I wasn't understanding Tree implementation in python until I got this tutorial. Thank you
@ludviklamb
I came to this video after not understanding Udacity’s explanation of it. You’ve done a fantastically better job at explaining this. Thank you !
@studyonly9080
Thank you for the playlist ❤❤❤ For Q.1 , I found it difficult to solve the logic.... For Q.2) It was pretty simple Using this playlist for my GATE preparation 💪💪💪
@devisowmyamorampudi1898
def print_tree(root,indent):
print(indent + root.data)
if len(root.children) > 0:
for child in root.children:
print_tree(child,indent*2)
print_tree(root," ")
This can get you the indentation without counting levels. btw thanks pal;)
@youneskhellaf202
An organized course and explanation, thank you
@sanjeevKumar-eg6hp
Thanks for a such simple and short explanation all information was to the point.
@codebasics