5. [3 points] Consider the following statement: a red-black tree will always have alternating colors at each level of the tree (i.e, all nodes of height 0 are black, all nodes of height 1 are red, etc.). Is this true or false? Briefly, why?

6. [3 points] Briefly explain why fixing the lowest imbalanced node of an AVL tree will necessarily re-balance the entire AVL tree.

5. [3 points] Consider the following statement: "a red-black tree will always have alternating colors at each level of the tree (i.e, all nodes of height 0 are black, all nodes of height 1 are red, etc.)". Is this true or false? Briefly, why? 6. [3 points] Briefly explain why fixing the lowest imbalanced node of an AVL tree will neces- sarily re-balance the entire AVL tree