CSC190H1 Midterm: csc190s_2001_midt
Document Summary
This exam is open textbook(s) and open notes. Use of computing and/or communicating devices is not permitted. Do not remove any sheets from this test book. The value of each part of each question is indicated. The total value of all questions is 100. Write your name and student number in the space below. Do the same on the top of each sheet of this exam book. To improve clarity, you may also wish to develop your code on the side before writing your final answer in the space provided. Answer the following questions by providing a very brief and direct answer. (1 mark). Can a binary tree that does not satisfy the binary search tree (bst) property be converted into one that does by using only node rotations? (1 mark). Can a binary tree that does not satisfy the bst property be converted into one that does by using only tree deletions? (1 mark).
