Hi You also have deletion but not included in the playlist I was lucky to have glanced at it on the recommendations. Hope you can add it for others to see in the playlist. Thanks a lot for these videos. Very helpful content.
Great video, but there is a detail in the definition missing, not only does left have to be smaller than parent, but all the elements in the left subtree have to be smaller. For example, if in the drawn tree, (1) would have (7) as its right child, you could not find it, since its in the left subtree of (3)
The definition you made is wrong.. BST should have the following properties Left(Right) subtree of a node contains only nodes with keys lesser(Greater) than the node’s key + The left and right subtree each must also be a binary search tree.
Your handwriting is as good as your explanation 🤗🤗
One of the most underrated channels in youtube. thanks for your clear explainations. I was able to get all of this in one go!
In the beginning you made such a perfect comma. Also good explanation.
Hi You also have deletion but not included in the playlist I was lucky to have glanced at it on the recommendations. Hope you can add it for others to see in the playlist. Thanks a lot for these videos. Very helpful content.
Thank you so much for this
You are great and you deserve my subscription.
Keep up
Great! Super easy.
I would like to see the ones for pre order and post order too.
Finally found a proper video .. thank you
Thank you so much maam. May live long and share her knowldge with people💚💓❤
The best 5:34 I have ever spent in studying and actually understanding
Great video. Thank you so much.
You are a life saver, Thanks!!
Great video, but there is a detail in the definition missing, not only does left have to be smaller than parent, but all the elements in the left subtree have to be smaller. For example, if in the drawn tree, (1) would have (7) as its right child, you could not find it, since its in the left subtree of (3)
I saw your other videos. Wonderful explanation. I wish you get lot of views and subscribers.
please can anyone refer me to a good text book for data structures and algorithms ?
quality content
thankyou i am sure you are gonna have many subscribers in coming days
Thank you so much mam
Thanks Ma'am
Ur voice is very nice👍😉
Thank you ☺️
The definition you made is wrong..
BST should have the following properties Left(Right) subtree of a node contains only nodes with keys lesser(Greater) than the node’s key + The left and right subtree each must also be a binary search tree.
just awesome explanation.
Thanks mam
Goood.... But don"t hilight ur word on screen....it is difficult to inderstand ur written word or diagram
Super
What if there is same number mam
Good
If only I watched this while in algorithms class.
Right child > = node , can be equal also
💖💖💖💯💯❣️ wow 🥺 beautiful
Why does every programmer write so nice lol
It’s almost the same *font*
👍
❤
Need more algorithms on stack tree queue
left sub tree of three what a tongue twister
Look like AI is explained.
tree and three was not loading well
nice explianation