The maximum number of nodes along any path from root to a leaf in a binary heap of 688 nodes is Answer: The minimum number of leaves in binary heap of height 4 is Select one: O A. pow(2, 4-2) O B. pow(2,4) O C. 1 O D. 4+1 O E. pow(2.4-1) The minimum number of nodes in a RB tree that has black height 5 is Answer: The following values are entered into an initially empty Red-Black Tree: 15, 10, 3, 12, 30, 18, 19, 25, 20 What value is at the root after all the insertions Select one: O a 12 O b. 20 O c. 15 O d. 10