Student Name: 13. Describe the procedure for removing a value from a binary search tree when the value to be removed has two "children". 14. What is the minimum height of a binary tree containing n items 15. What is the maximum height of a binary tree (unbalanced) containing n items? 16. Adding, removing, and finding values in a binary search tree have the Big-O value for performance in time. List the best case and the worst case performance for adding a value to a balanced and ordinary (unbalanced) binary tree. Hint: They are different! 17. When adding to an ordinary (unbalanced) binary tree, under what conditions does the worst case occur? 18. In a binary search tree, while attempting to find a value, how does the program determine that the value is not in the tree? 19. In a binary search tree, if an "in order" traversal of the tree is performed and each value is printed as it is encountered, would the values be printed in sorted, or unsorted order? 20. What is the purpose of the Visitor interface and the classes that implement it in the binary tree program we built in class? 21. Does your name appear in the heading of this page? If not, put it there