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 = 618816)Given a BST whose level-order traversal is: 11 94 31 92 62 52 63 44 77 89 Suppose that you search for the key 53. Give the sequence of keysin the BST that are compared with 53 during the search miss.Your answer should be a sequence of integers, separated by whitespace.
(seed = 800493)Given a BST whose level-order traversal is: 15 10 72 36 92 28 41 88 95 52 86 66 What is the level-order traversal of the resulting BST after Hibbard deletingthe following three keys? 86 41 72 Your answer should be a sequence of 9 integers, separated by whitespace.
(seed = 87548)Which of the following statements about binary search and binary search trees are true? Check all that apply. Unless otherwise specified, assume that the binary search and binary search tree implementations are the one from lecture.
In the worst case, the number of key compares to binary search for a key in a sorted array of N distinct keys is ~ lg N.
The expected height of a BST containing N nodes that results from a sequence of random insertions and random Hibbard deletions is logarithmic in N.
Consider a node x in a BST. Then, the successor of x (the node containing the next largest key) is either the parent of x or the leftmost node in the right subtree of x.
The expected height of a BST that results from inserting N distinct keys in random order into an initially empty BST is ~ 2 ln N.
Given a sorted array of N distinct keys and a key x, it is possible to find the number of keys strictly less than x in logarithmic time in the worst case.