ViewTube

- [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 ...

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

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 ...

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.

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

- [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 ...

Well, one, if we think about a binary search tree I can't give it to x because x already has two children. My only options are, either I ...

We still have 75 being the root node, since it was just inserted. We have a 50, we have a 25, so normal binary search tree rules ...

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 ...

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