ViewTube

What happens if I were to come in and I were to do a remove on 40? Now, 40's my root again, so once again, we mark it as my in, ...

... just like we saw when I was dealing with just a root, I remove N. In our case, we would... remove N, and we're left with the tree ...

... we wanted to do a little bit more of a complex removal, something like remove... Fifteen. So just like a normal binary surge tree, ...

- [Narrator] So what if given this tree here, I gave the remove operation of remove 50? Now you remember in the previous video, ...

- [Narrator] So now let's say for our sake I came across this tree and I made a remove 25. So we're kind of in an interesting position ...

- [Instructor] So what if I wanted to attempt to remove a node that doesn't exist. So in our case I wanted to remove say for example ...

And what if, say for example, say I wanted to give it the removal operation of remove(3). Since we're in a binary tree I would first ...

If I came in and wanted to do something like an insert six, so we'd follow the same rules as a binary search insertion, or binary tree ...

So what occurs if this time I do a remove on 20? Go ahead and pause the video and see if you can work that one out on your own.

So what actually happens is we start to look at those nonexistent nodes or those sub-trees again that we were just talking about.

There is an error on step 5, I fix the error later in the video - luckily, it doesn't break everything, it just needed a minor fix.

Well, these are actually the same kind of structures that we were seeing when we were dealing with an AVL tree. We just kinda ...

hello last time we were working on uh building this binary tree and it might have the node class and i kind of copied that and just ...

- [Instructor] So we do have a limitation when it comes to the binary search tree. Let's say for example I came in and said ...

... do i have value x without checking every single node so binary search tree the b stands for binary which means each node has ...

We have a 50, we have a 25, so normal binary search tree rules apply: 30 is less than 75, it's less than 50, but it's greater than 25.

Now, I'm not just going to swap 25 and 15 because that would actually break the laws of a binary search tree. The entire premise ...

Hello Friends, this video contains phase 1 of heap sort i.e. how to construct the heap tree with given values.

- [Instructor] So we've already started to learn about something we called a binary search. The idea is that if I had some list, in our ...

so in the last video we built this node class that we can use for a binary search tree and we saw that we can very efficiently run this ...