I cut down a cherry tree.

He cut down a cherry tree.

He cut down that cherry tree.

There's an old cherry tree in the garden.

There's a dead body under the cherry tree!

There was a cherry tree growing in the garden.

There is a cherry tree in front of my house.

There used to be a big cherry tree in the garden.

There used to be a big cherry tree behind my house.

Tom took a picture of Mary standing under the cherry tree.

He can't tell a cherry tree from a plum tree, but he can name them in twelve languages.

longer going to be a red black tree.

So, this is yet another red black tree.

So now, red black tree with N nodes.

Here's an example of a Red Black tree.

There used to be a big cherry tree at the back of my house.

So, can this be made a red black tree?

So how many of you know the story about George Washington and the cherry tree?

There's a black hat caught in the high tree top.

So, that's a non example of a red black tree.

So, we can write in a red black tree with

I saw a young man lying on the bench under the cherry tree in the park.

So here's our invariant checker for the class Red Black tree.

So, let's look at an example of a red black tree.

But the interesting thing is that... however much they change, they keep the shape of a cherry tree.

If I want to search an element in a Red Black tree,

Cherry on the top.

It says, well actually, black nodes are a majority of nodes in the tree.

Cherry blossoms are very beautiful.

Is that cherry or boysenberry?

So, let's now combine that with a red black tree invariant to see why red black trees have to have small height.

So, if we have this red black tree where everything's black, and we insert, say, six, that's going to get inserted down here.

So, what's the point of these seemingly arbitrary four invariants of a red black tree?

Suppose I want to check whether the number 22 is in my Red Black tree

So search in Red Black tree is easy but insertion and removal are really complicated.

The pixels are for the left scan line black, red, black, black, black, black and for the right scan line black, black, black, black, red, and black.

Cherry blossoms are in full bloom.

The cherry trees were in flower.

Our garden has two cherry trees.

And put a cherry on top.

Man, marshmallow and cherry on steak?

He used a goddamn cherry bomb.

Black card, black card. Listen. Black card, black card.

A Red Black tree is a data structure to represent associative arrays also known as mappings.

Have you ever eaten ripe Barbados cherry?