Your not editing out the parts where you get confused (like with the returns in the recursive methods ) is wholesome . It’s what others don’t do . And this is a priceless lesson for everyone who has not been confronted with those kinds of problems before . Fan since started to code.
Dan, I think you left out the most important (and hardest) part of binary trees; namely, keeping the tree balanced. Consider, for example building a tree using the numbers from 1 to 100 in ascending order. The root node would be 1, and there would be 100 nodes none of which would have a left node. Nothing but a linked list. Balancing the tree after each insert avoids this. I wouldn't expect you to actually do tree balancing in a quick coding challenge, but I think the task should be mentioned, and should perhaps challenge us, the viewers, to work out how to do it. Or.. make it a coding challenge by itself (?)
Thanks for the series on binary trees. We used them to sort images according to similarity. Thanks also for opening object oriented programming for me. 20 years of people telling me it was like dogs and cars didn't do the job. Seeing someone do practical examples made it so clear!
The pictures you saw in the image search are perfectly fine: they're pictures of binary trees; that is, trees where each node has up to two children. However, not all binary trees are binary SEARCH trees, which are ordered the way you expect. Had you searched for that instead you'd have gotten the expected results :)
The images you were looking at are " binary tree " which represents data structure tree with max 2 degree of nodes... the structure yoy wanna look for is " binary search tree "
To clarify, a Binary SEARCH Tree is what he is implementing. A Binary Tree in general is just a tree in which all parents have (at most) two children. The difference is that a Binary Search Tree is a special kind of Binary Tree in which the the children will either be to the left of the parent or the right depending on if the child is less than or greater than it's parent. :)
This can be used for datapacking if instead of smaller or larger numbers use the commodity of the item and the more common it is the higher it is now 1 or 0 will be left or right and boom most efficient datapacking without a separate library
Aliens from the future tell you ES2015 introduced classes in JS. I really like the fact that you delegated the Node class to visit() and search() as this seems way more reasonable than putting a bunch of code within Tree class, because in the end Tree is just a wrapper while Node is a meaningful representation of a tree. As weird as it may sound.
Yo Daniel try only using one return statement and just assign a variable to what you want to return and return the variable it will make your code simpler and easier to debug and update.
Why not use a Linter to avoid all those small bugs? Anyway, thank you for your effort. PS: you can use "comma" in console log: `console.log('Found', someObject);`
I love the reasoning and unedited display of bloopers. This gives it a human touch and is way more realistic, than pretending to get everything correct the first time. Thanks! 🙏🏻 😊
Inspired by the phone book example. In psychiatric hospital a doctor gave a phone book to a patient. After a week the doctor meets the patient again and asks him about the book. The patient answered, the story is not really interesting, but the number of characters is really impressive. Great job Dan love your work. Greetings from Geneva Switzerland.
that's so easy and common that I'm 16 and I've already seen that about 5 times and I'm not even doing anything related to it..,not doing anything at all, actually, but kinda learning programming... I love phone books and Compact Disks
16:10 you were looking at binary trees but you were actually talking about binary search trees. In BSTs, values are stored like the way you explained but binary trees just store values with no special order.
sarvagya agarwal I wouldn't say that. Anyone can easily get confused during coding sessions like these. Also, if you haven't then go check out his other videos, he knows his shit.
Oh i know , it just seems like he has forgotten the basics , i mean data structures and algorithms is the first course they teach you in computer science .
I hopped on the coding train about two weeks ago and I have been binge watching all of your videos man. You are a great, enthusiastic teacher. I looked you up and saw the Swarm project and was amazed. Thanks for teaching all of us!
I do have a problem. I need to sort numbers as follows: Let's say there are 10 numbers (322, 456, 423, 412, 513, 123, 432, 321, 254, 253), now I need to kind of "fit" these into another fixed number like 1100. So whatever combination of these 10 numbers comes close as possible to 1100 (could be less but not more) should get selected. Furthermore it can't be more than 4 numbers in one combination. This loop should be running until all numbers are chosen and combined. How could I get this done. Maybe there is already a video out there.
from my understanding (hope this make sense lol also I could be completely wrong) every time a value is returned it is returned to whatever directly called it. You can't make indirect returns so the solution to returning indirect values is to return the value to its previous call in a chain until its returned to the direct function initialization. So when the search function is initially called it checks its value to the root value and if they are the same then THAT value/node is returned if not then the value is returned at the node it is found but not to the initial function call instead its returned to the previous one and then that value is returned to the previous one before that and so on but it will never be returned in the console because the final return to the initial call doesn't exist as you can probably tell this chain of returns did take place but never completed to the first call which is why he needed the return calls in the "this.left.search(val)" and the "this.right.search(val)' to make the final return call to the variable found in the "tree.prototype.search" hope that made sense!
Hi, very cool videos it's an awesome way to learn interesting programming concepts. On the topic of tree structures I was wondering if you could do a video on a QuadTree implementation to show spacial distribution. I'm using QuadTrees on procedural planet generations in games and found it very challenging but interesting. Thanks !
When I was watching one of your videos for the first time I thought: "Who is this crazy guy and why is he so happy all the time?" In all honesty I didn't really like you but then I watched some more of your videos and now I'm subscribed. I like to watch your videos when I'm programming because its really relaxing. Keep up the good work! Really looking forward for more videos. :)
I was confused about prototype, but now I have translated the binary tree search from your code to python I see it is basically a function inside a class (in python terms anyway). I'm still new to coding in general so hopefully someone will correct me if I'm wrong.
I'm learning C, and this is in JS which I don't know at all. But I understand clearly what he is doing. Also from his videos I started to understand what is OOP!
Please Coding challenge: how to draw binary tree (or ternary or other subtypes), and how to draw graph! It would be amazing learn how it visually looks like graphs and trees. I love your videos (: A viewer from Cancun, Mexico.
You are teaching binary search trees, which is a type of binary tree. I'm sure if you google "binary search trees" the images will display a sorted tree.
I had to a CS assignment that does math with a binary tree, with number leaves and operator inner nodes. By the way, you don’t need a tree type. When you add a node, if the root is null, you set it to the node, otherwise you recurse to the left or to the right.
Hey Daniel, i just started programming a couple of days ago and now I'm wondering which programming language/ environment to learn first. I absolutely love the coding challenges which are mostly done in p5js which I'm feeling more comfortable with atm but I'm planning to read your book and it is all about processing. I'd like to get good with one of the languages and transitioning between them shouldn't be too hard then but which one do you recommend for starting off? Please keep on doing what you are doing, mfg.
Oh, this is such a hard question! It really doesn't have an answer. Does one appeal to you more for one reason or another? If you care about having your stuff on the web then I would say JS, if not then maybe try Processing? I don't know!
Sir Will you please START JS WITH UNITY because I love your teaching skill and programming skill. When Sir you will start unity there will new world appearing
Can this be used with an Expert System and Rules Structure to teach the computer by giving more and more detail but instead of a Node concept it would be frames Following Marvin Minsky's Idea of Frames and Agents?
OOH! Here's how to pronounce it (:rofl:, please *don't* waste your time here! xD) Aa-thi- (It is like a mixture of 'd' and 'th'; STRESS a 'th' sound.) -thya- (This one is your normal 'th' sound.) 'Y.' (The letter 'Y') Bhar- (It's pronounced more like "Bh-aaar" with a stretched 'aah' sound.) -gava. (Just like 'guava' but without the 'u', of course!) "Aa-thi-thya Y. Bhar-gava" That's the name! Yep, "Hindi" (The official language here in India. 'd' here has a little bit of the 'th' again ;] ) ..is hard to pronounce for anyone who is not Indian, I agree. Hopefully this wasted everyone's time, ( _then why did I do this!? :rofl:_ ) ..but taught you some pronunciation skills, I would like to imagine? ...aaaaaaand although I am pretty sure everyone did, you probably know that ":rofl:" is a reference to this emoji: "🤣". Ok-uh....before I waste more of your time...I'm outta here :/ v-v-v-v-b-bYE! :D!
It's probably cos I know little about coding, but watching this guy do his thing (he obviously knows what he's doing) is like watching a schizophrenic converse with himself.
that chat can't debug everything you know, unfortunately can do nothing for crazy. unless fun fun function gets in their, he got ahead of the crazy curve, a little. some may say he could be little "late to the chat too"
Anyone interested in a Python implementation, feel free to check out my recent lesson: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-f5dU3xoE6ms.html
