Please answer all questions

Use the tree in Figure 1 for exercises 1, 2, 5, 6, 7,and 8. Figure 1 1. What node or nodes are a. The tree's root? b. Parents c. Children of the parents in part b? d. Siblings? e. Ancestors of 50? f. Descendants of 20? g. Leaves? 2. What is the height of the tree? 3. Write preconditions and postconditions for the ADT binary search three operations (the methods declared in the interface template for the ADTbinary tree (see Chapter 15 Listing Code.html) 4. Consider a method isLeaf that returns true if a binary tree is a one-node tree that is, if it consists of only a leaf and returns false otherwise. a. Specify the method isLeaf (write the specifications of the method isLeaf) b. Is is Leaf were not a method of a class of binary trees, would a client of the class be able to implement isLeaf? Explain 5. Starting with an empty binary search tree, in what order should you insert items to get the binary search tree in Figure 1. 6. Using the binary tree in Figure 1, trace the search algorithm when it searches for a. 30 lb. 15