CS 270 Assignment 6
# 61313
Chapter 9 4. Consider the list: 2,10,17,45,49,55,68,85,92,98,110 : How many comparisons are required to find whether the following items are in the list? Show values of first, last and mid and the number of comparisons after ea
CS 270
Chapter 11 14. Suppose that you are given two sequences of elements corresponding to the inorder
sequence and the preorder sequence. Prove that it is possible to reconstruct a unique binary t ree.
Assume the nodes in your tree have a field that id