In this video you will learn what a Binary Search Tree is. More importantly though you will learn how to build one yourself in JavaScript. The finished Tree will include the lookup, search & remove methods.
These 3 methods will be covered in their entirety & will be fully explained, so that by the end of the video you will have a crystal-clear understanding of how to translate the Binary Search Tree concept into real, working code.
Note that I will not abridging any information when I get to the hardest out of the three methods, the remove method. Even though the remove method is tricky to get your head around I will employ the use of animations, in conjunction with lucid explanations to get you understanding the different scenarios that can arise when we want to remove a specific node in the tree.
📚 Materials/References:
The completed code: replit.com/@LF...
🧠 Concepts Covered:
What a Binary Search Tree is & what separates it out from other kinds of trees.
The difference between a balanced & an unbalanced tree.
What a time complexity of ‘O(log n)’ means & how Binary Search Trees have it.
How to remove a node from a Binary Search Tree & the different removal processes that need to be used in relation to the position of the node that we want removed.
How to search for a specific node in a Binary Search Tree
How to append a new node to a Binary Search Tree & have it in the correct place.
💻 Technologies used:
JavaScript, written on the online IDE, replit.
If you enjoyed this video then please consider liking 👍 and subscribing. You would be doing me a huge favour if you did this and it would be greatly appreciated ❤️ by me. Likewise, if you have any queries or comments that you want answered. Then please, don’t hesitate post them down into the comments box below. I would love to hear back from you and will answer all of your questions to the best of my ability.
Stay awesome guys. ❤️
#ComputerScience#CS#BinarySearchTree#JavaScript#replit#timecomplexity#BigONotation
6 окт 2024
