Warning: The hard deadline has passed. You can attempt it, but you will not get credit for it. You are welcome to try it as a learning exercise.
To specify an array or sequence of values in an answer, separate the values inthe sequence by whitespace. For example, if the question asks for the firstten powers of two (starting at 1), then the following answer is acceptable: 1 2 4 8 16 32 64 128 256 512If you wish to discuss a particular question and answer in the forums, pleasepost the entire question and answer, including the seed (which can be used bythe course staff to uniquely identify the question) and the explanation (whichcontains the correct answer).
(seed = 262747)Consider the left-leaning red-black BST whose level-order traversal is: 60 46 78 26 57 65 97 20 45 47 63 71 91 List (in ascending order) the keys in the red nodes. A node is red if the linkfrom its parent is red. Your answer should be a sequence of integers, separatedby whitespace.
(seed = 707982)Consider the left-leaning red-black BST whose level-order traversal is 38 30 75 21 33 39 99 19 22 78 ( red links = 21 78 )What is the level-order traversal of the red-black BST that results afterinserting the following sequence of keys: 11 29 91 Your answer should be a sequence of 13 integers, separated by whitespace.
(seed = 79221)Which of the following statements about balanced search trees are true? Check all that apply. Unless otherwise specified, assume that the 2-3 tree and red-black BSTs are as described in lecture (e.g., 2-3 trees are perfectly balanced and red-black BST are left-leaning red-black BSTs with internal links colored either red or black).
In a red-black BST on N nodes, the black height (number of black links on every path from the root to a null link) is ~ lg N.
Consider inserting N keys in ascending order into an initially empty red-black BST. Then, the total number of color flips is at most N.
Consider a red-black BST on N nodes in which every link is black. Then, N+1 is a power of 2.
Consider inserting N distinct keys into an initially empty red-black BST. Then, its black height equals the number of color flips at the root.
The height of a 2-3 tree on N keys is solely determined by N.