Data Structures and Algorithms in Ruby: Binary Trees

In this video I walk you through how to code up a binary search tree in ruby.
We start by creating the BinaryTree and Node classes and then add a find algorithm that allows us to search our binary trees to see if they contain a value.
Thanks for watching let me know if you have any question in the comment section below.

[@tito-lx2rp]

Excellent explanation! New subscriber

[@santaclause1988ify]

Please keep these Data Structure and Algorithm videos coming.

[@MinionNil]

great video, thnx you!

[@MoeNegm]

i added this to line 10 because it's easier to see true or false instead of the blank nil: return find_helper(root, value) || false also for the puts i did this: puts bt.root.right.nil? it would return true if it's nil. it doesn't change anything to the code it just makes it easier to test. another excellent tutorial, THANK YOU!

[@teetanrobotics5363]

Bro awesome content. Need other data strcutures as well. stack, queues heaps, etc. Also need louder mic.

[@connerjensen8170]

Noted!

[@phanta5m]

Simple yet clear explanation

[@azhagurajaallinall126]

I thought to search DSA Tutorial in Ruby(simple style of ruby) & i got yours .. Awesome bro,keep doing it 😃🌟✨🙌 72'nd like,1831'st view,15'th comment & new sub from now 😇😊 Love from brother at India 24.01.2023 07:48 pm ist

[@user-lg8dj9dz1l]

Дякую! Nice content.

[@kylespeller]

This is so hopeful. Thanks a ton. You did a great job explaining this

[@jekoapulava3908]

I literally learned everything thanks to you. Hope you doing well and waiting for your new videos

[@louisritter6798]

Are there more videos in this series coming? Very good content and clear explanations

[@amitkumar352]

Excellent content, just curious that is it okay to use Struct for creating nodes like Node = Struct.new(:value, :left, :right)?

[@connerjensen8170]

Thanks! Yes that is a great idea, I think a struct would be a great replacement for the Node class. Thanks for your comment!

[@GokuSan389]

Hello nice video, can't wait to see the next one. Just did this exercise, keep them coming. However I have an itsy-bitsy tiny correction :) In Node initialize method you can use keyword arguments so you don't have to reassign nil values for left and right, i.e. left: nil, right: nil, value: nil. I am curious though should value be initialized as nil, should binary tree hold a node with nil value 🤔

[@celinepatagmiranda7849]

Is using self the same as using @? Example self.value = 4 VS @value = 4

[@ljkafds]

It would have the same effect, which I'm guessing is the reason people asked in a previous video-it's a bit more concise and idiomatic to set the instance variable over using the attr_writer in initialize, but both work.

[@okumuoriaro4994]

Is it me or I can't hear a thing dude, why are you swallowing your words?