Short Answers 1. Here is a small binary tree: 14 2 11 1 3 10 30 Short Answers Section 10.1 Introduction to Trees 7 40 Circle all the leaves. Put a square box around the root. Draw a star around each ancestor of the node that contains 10. Put a big X through every descendant of the node the contains 10. 2. Draw a full binary tree with at least 6 nodes 3. Draw a complete binary tree with exactly six nodes. Put a different value in each node. Then draw an array with six components and show where each of the six node values would be placed in the Short Answers 4. Write the private member variables for a new node definition that could be used for a node in a tree where: (I) Each node contains int data, (2) Each node has up to four children, and (3) Each node 5. Draw a binary taxonomy tree that can be used for these four animals: Rabbit, Horse, Whale. Snake 6. Using the binary_tree_node from Section 10.3, write a function to meet the following specification. Check as much of the p array (using the usual array representation of a complete binary tree) Section 10.2 Tree esentations also has a pointer to its parent. Store the pointers to the children in an array of four pointers. Short Answers Section 10.3 A Toolkit for on as possible. No recursion is needed. Bir Tree Nodes template cclass Item void aubawap(binary tree node Using the binary_tree_node from Section 10.3, write a recursive function to meet the following specification. Check as much of the precondition as possible. template cclass Item void flip(binary tree_nodecItem root_ptr) I Precondition: root ptr is the root pointer of a non-empty binary tree Postcondition The tree is now the mirro image of its original value Exanple original tree: Exanple new tree