Chapter 23 - 25: Trees and Binary Search Tree 1. How many ancestors does a node have in the Nth level of a tree? 2. Consider the following tree tree a) What is the height of the tree? b) Which nodes are on level 3 c) Which levels have the maximum nodes that they can contain? What is the maximum height of a binary search tree containing these nodes? Draw the tree c) What is the minimum height of a binary search tree containing these nodes? Draw the tree CSIS 210 Assignment #5 Fall 2021 Due Tuesday January 4, 2021 9:00 PM What is the order in which the nodes are visited by inorder traversal? ) What is the order in which the nodes are visited by preorder traversal? h) What is the order in which the nodes are visited by postorder traversal? 3. Write a recursive public method in our BST class that returns a reference to the information in the node containing the smallest value in the tree. The signature of the method is public T min)