Комментарии:
how are you getting the value from current if current isn’t connected to the node in any way, current should be an empty variable because you didn’t do assign anything to it
ОтветитьTim I can't thank you enough!!!
Thank you
How do we call the function ?
BST=BinarySearchTree()
BST.add(5)
BST.add(8)
BST.add(7)
BST.add(12)
BST.add(1)
BST.add(10)
BST.add(2)
I did this and I am unable to get the required results
I am getting an error "ST.add(5)
TypeError: BinarySearchTree.add() missing 1 required positional argument: 'value' "
Somebody please help me with this
Thank you for your work! It is really good explanation allowing to get known and understood the foundation
ОтветитьAgain I came here after not understanding the concept in another video and yes, Tim never disappoints me.. His video was clear and it's even easy for beginners like me to grasp the code.. Thanks million..!
ОтветитьI think code for traversing is wrong... You are not handling the None case, like when we reach the end of the tree, we cannot print any thing like node.value.. please have a look
Ответитьwe need these type of vids back
Ответитьyour code doesnt work I tried to implement it nothing is working
ОтветитьAmazing explanations!!!
ОтветитьGreat presentation, easy and to the point!
ОтветитьAwesome video, so easy to understand the concept. Helped me with my assignment. Thank you.
ОтветитьIt would be great if you show output as well.
ОтветитьSo clear. Noice
ОтветитьThis video is just wow.. Thank you.. no one could have explained this better
ОтветитьI could not understand the "current" argument passed. You seem to talk more and demonstrate with example very less. I expected a better tutorial from you.
Ответитьwhat a king , thx brother luv from Turkey!!!
ОтветитьNICE VIDEO THANKS FOR TEACHING
ОтветитьVery simple and precise explanation.
ОтветитьThank You
ОтветитьThen if the Node to add is equal to the root node will it go to the right side of the tree?
ОтветитьIn the add() function, aren't we supposed to declare current = self.ptr_to_root? Because, otherwise how can we use it the way we have?
It is not defined at all.
Please explain me If I am wrong!
Wanting to learn.
Great tourial
ОтветитьVery helpful, thank you!
ОтветитьDude, this video is pure gold. I'm trying to really get into algo and data structure and this is clearing up so many things for me ! It deserves way more views !
ОтветитьThe insertion time to the tree is log(n) only if the tree is balanced, If you insert a set of numbers are in increasing (or decreasing) order, you end up with a binary tree that has a height of (n)
ОтветитьBro?? Are these 7 videos in the playlist enough to learn data structure?? It's been 1 year now,
Ответитьcan you please post some videos on data structure and algorithms using python (BST,heaps,sorting,dijkshtra algorithm,bellman ford algorithm, prims and kruskals algorithm , graph algorithms etc)
ОтветитьI'm having trouble instantiating the tree lmao. Can anyone help?
ОтветитьData structures master? New videos :)
ОтветитьThe implementation of "add" will fall into a linked list if the elements are inserted in perfect order. So the time complexity will degrade to O(n), which is not log(n) anymore.
Ответитьmade all videos on data and algo
ОтветитьThanks so much Tim! I've been having problem solving a challenge pertaining to BST, but this video helped me out!
Keep the good flag flying!💖
Great explanation. Thank you very much!
Ответитьwhich gamer chari do you use¿?
Ответитьitd be great if you make a video talking about the topics youre studying at school
ОтветитьTim please continue making these long videos. I love the in-depth knowledge
ОтветитьAre you going to teach other data structure and algorithms in the future
ОтветитьPretty much interesting
ОтветитьI finally understand how to implement BST in code. Thank you! Keep making videos. I will enjoy watching the next video about BST.
ОтветитьThis is the best thing because they're teaching me same thing in my current semester, <3
ОтветитьPlease do segment trees with their implementation!
ОтветитьJust yesterday I was thinking about your videos on Data Structure. Thanks
ОтветитьLove your videos. Keep em coming.
Suggestion: I am trying to digest git. Could u plz do a post on that?
Awesome,
Looks like you are learning data structures in your college :D
I want to learn python .....and I know all the basics.....so what should I to do next to become a good python programmer ??
ОтветитьYou are awesome! ❤️
ОтветитьIt’s demetri
Ответить