Questions about the following red-black BST:

Is the above tree is valid red-black binary search tree?

In the above tree, what is the number of black links in each root-to-leaf path?

If the tree is not a valid red-black BST, which property is violated: the root must be black, at most two red edges can be connected to each node, red edges are left-leaning only (i.e., they can only link to left children), the number of black edges in all root-to-leaf paths is the same, the tree is a valid red-black tree

If the tree is not a valid red-black BST, which operation(s) are used to correct the violation(s): left rotate, right rotate, color flip, the tree is already a valid red-black tree

True or False: After adding T to the above tree and before correcting any possible violations, the tree will be a valid red-black binary search tree.

If the tree in the previous question (i.e., after adding T) is not a valid red-black BST, which operation(s) are used to correct the violation(s): left rotate at S, right rotate at S, color flip at S, left rotate at T, right rotate at T, color flip at T, left rotate at X, right rotate at X, color flip at X, left rotate at R, right rotate at R, color flip at R, left rotate at M, right rotate at M, color flip at M, the tree is already a valid red-black tree

After adding T to the above tree, what is the number of black links in each root-to-leaf path?

Violations of the red-black BST properties are detected when: going down from root to leaf (i.e., before the recursive calls), going up from leaf to root (i.e., after the recursive calls), in both directions

M J R E L X . S A M J R E L X . S A