Prove that the height of a red–black tree is at most approximately 2log N and give an insertion sequence that achieves this bound. Show that every AVL tree can be colored as a red–black tree. Do all...

Prove that the height of a red–black tree is at most approximately 2log N and give an insertion sequence that achieves this bound. Show that every AVL tree can be colored as a red–black tree. Do all red–black trees satisfy the AVL tree property?