red-black trees after new node is insertedred-red conflicts are checked again if violation is foundappropriate rotations are carried out to make the tree red-black correct these adjustments result in the tree being balancedor at least almost balanced adding red-black balancing to binary tree has only small negative effect on average performanceand avoids worst-case performance when the data is already sorted questions these questions are intended as self-test for readers answers may be found in appendix balanced binary search tree is desirable because it avoids slow performance when data is inserted in balanced treea the tree may need to be restructured during searches the paths from the root to all the leaf nodes are about the same length all left subtrees are the same height as all right subtrees the height of all subtrees is closely controlled true or falsethe red-black rules rearrange the nodes in tree to balance it null child is child that doesn' exist but will be created next child with no children of its own one of the two potential children of leaf node where an insertion will be made non-existent left child of node with right child (or vice versa which of the following is not red-black rulea every path from root to leafor to null childmust contain the same number of black nodes if node is blackits children must be red the root is always black all three are valid rules