Binary Search Tree - Beau teaches JavaScript

A binary search tree is a tree data structure with only two branches for every node. Learn how to implement a binary search tree in JavaScript ES6!

⭐JavaScript Playlists⭐

-
We're busy people who learn to code, then practice by building projects for nonprofits. Learn Full-stack JavaScript, build a portfolio, and get great references with our open source community.

[marshalltrimble]

Can we all appreciate how well he went over this and well he tried to make sure that the depth of this was covered along with walking the viewer through a journey of creating a mental map and understanding of a BST.

[BrianCooper-qp]

Not only a detailed code walkthrough, but also de-jargoned. Instant sub

[Lashistoriasdelilith]

I had to slow down the video because you speak too fast to follow the code while you explain it. The explanation was really clear. Thanks.

[xerxius]

Very well explained !

Here is the shorter version of add function if anybody wants a terse code

add(data, node = this.root) {
if (this.root === null) this.root = new Node(data);
else if (node === null) return new Node(data);
else if (data === node.data) return;
else if (data < node.data) node.left = this.add(data, node.left) || node.left;
else node.right = this.add(data, node.right) || node.right;
}

[blue_mustang_]

High Complex topic brilliantly explained.Thank you very much !

[LeonC]

what happens is the left sub node after the right sub node is lower than the left node??? for example instead of 1 it was a 2, and instead of 4 you had a 1. Then you would be replacing 3 for one which would have two children greater than itself.

[yogeshsharma]

Because of diagrammatically explanation it cleared all my doubts..
Thank you so much for this amazing idea of teaching 🙌

[pranshul]

thank you! Finally understood node insertion in BST after watching your

[jugzster]

Clear and detailed way of explaining BST, thanks! Amused by the way you say "root" :-)

[リンゴ酢-bg]

A balanced binary tree, also referred to as a height-balanced binary tree, is defined as a binary tree in which the height of the left and right subtree of any node differ by not more than 1.

[bryang]

Thank You so much. Your data structure videos have made the difference for me in cs fundamentals.

[ermalgashimramori]

Thank you, loved the way you approached the subject, and it all clicked in for me. Thank you.

[beqasirbiladze]

4:23 23 left child is 19 and not right

[jumpmannith]

What if you want to remove a node but its right node doesn't have a left child? Which node will take the place of the node to be removed? Just wanted to confirm my guess.. It is going to be the right node?

[DanielSanchez-kgzy]

hi just some questions :D, why data is 23 and why in 5:25 23 it says that is null when in the graphic obviously appears?, im new in all this about nodeTrees.

[victorvondoom]

wat about 17 number that you were about to delete, theres no right node with left child so what should i do in such a case

[jayp]

Cool. Another tip is to try and use while loops instead of recursion for better performance. One way to do this is to say while(node), check your cases, set the node equal to the left or right child. The while loop will terminate on null. This is done for the findMin, findMax functions but not for the add function. As an exercise, see if you can rewrite the add function using a while loop instead.

[adriangrozavu]

The audio quality could be better, but otherwise I'm liking it

[thoaily]

I'm wondering if there are any built-in BST classes in JavaScript because I don't want to implement the tree every time I want to use it

[MyALPHAguy]

What is this tree for? When am I going to use it?