Statement True False O (a) All red-black trees are full by construction. O (b) The right most leaf of a 2-3 tree contains the largest key in the structure. O (c) Asymptotic analysis can be used to determine the growth rate of the storage space required by a given data structure when the problem size grows. (d) Each node in a treap contains a key and a randomly generated priority. O (e) AVL tree rotations are used to restore the BST property after insertion of a new key. . O (f) The root of a red-black tree is always red. . (g) In a binary min heap, the largest key will always be found in a leaf. O O (h) According to Dr. Mount's notes, the expected height of a BST created by inserting n random keys is O(log n). O O O (i) The height of a red-black tree that is the encoding of a (2-3) tree is at least twice the height of the (2-3) tree