As always, please include a contract, a purpose, examples, and tests for each function.
Exercise 17.6.1. Important: the two given lists are already sorted!
Think carefully of test cases. Specifically, consider the cases in which at least one of the lists is empty or one of the lists only has one element. Write down these test cases and expected values before you write your function. These test cases will be graded.
Exercise 17.8.8. Two trees are the same if all of their nodes are the same (the same ssn, name, and the same position in the tree).
Once again, test the function carefully: test cases will be graded. To
simplify generating test data, I will send the add-bst
function (that we wrote in class) by e-mail.