undefined

QUESTION 1 Consider the following two questions: 1) In a red-black tree, if a node is red, then one of its children can be red and the other child can be black. 2) The following tree can be colored as a red-black search tree with keys ordered alphabetically. G E M ADN O Both statements are True. O 1) is true, 2) is false O 1) is false, 2) is true O Both statements are false. QUESTION 2 Consider the following two statements: 1) If the height of a binary tree is the maximum number of edges in any root to a leaf path, then the maximum number of nodes in a binary tree of heighth is 2h+1 -1 2) In a binary search tree with no repeated keys, deleting the node with key x, followed by deleting the node with key y, will result in the same search tree as deleting the node with key y, then deleting the node with key x. O Both statements are true. O 1) is true, 2) is false. O 1) is false, 2) is true. O Both statements are false