Are AVL trees always a subset of red black trees?

Question

I am searching for a proof that all AVL trees can be colored like a red-black tree? Can anyone give the proof?

Answer 1

Ok, ik give you a hint

Have a look at: AVL Tree and Red black Tree, if you understand that, the proof should be trivial.

Answer 2

I suspect the answer is no.

AVL trees balance better than RB trees, which means they balance differently, which would rather imply that you could not colour every AVL tree as a valid RB tree.

Answer 3

The answer is yes, every AVL tree can be colored Red-Black, and the converse doesn't hold.

I haven'y exactly figured out HOW to do it tho, and am also seeking the proof.