PPT Slide

7

5

3

2

1

4

6

8

9

10

11

BST Counterexample

Add node 11 to satisfy necessary

and sufficient conditions at every node.

Now breadth-first algorithm can be used to generate this

BST, and then node 11 can be deleted.

We are now working on the conditions to generate all

red-black trees with N nodes.

Previous slide

Back to first slide

View graphic version