the two possible actions used to balance tree are and newly inserted nodes are always colored which of the following is not involved in rotationa rearranging nodes to restore the characteristics of binary search tree changing the color of nodes ensuring the red-black rules are followed attempting to balance the tree "crossovernode or subtree starts as and becomes or vice versa which of the following is not truerotations may need to be made before node is inserted after node is inserted during search for the insertion point when searching for node with given key color flip involves changing the color of and an outside grandchild is on the opposite side of its parent that its parent is of its sibling on the same side of its parent that its parent is of its parent one which is the left descendant of right descendant (or vice versad on the opposite side of its parent that its sibling is of their grandparents true or falsewhen one rotation immediately follows anotherthey are in opposite directions two rotations are necessary when the node is an inside grandchild and the parent is red the node is an inside grandchild and the parent is black the node is an outside grandchild and the parent is red the node is an outside grandchild and the parent is black true or falsedeletion in red-black tree may require some readjustment of the tree' structure