Draw all the structurally different red-black BSTs with N keys, for N from 2 up to 10 (see...

Draw all the structurally different red-black BSTs with N keys, for N from 2 up to 10 (see exercise3.3.5).

Exercise 3.3.5:

The figure at right shows all the structurally different 2-3 trees with Nkeys, for N from 1 up to 6 (ignore the order of the subtrees). Draw all the structurally different trees for N = 7, 8, 9, and 10.