reate a function that uses Node * pointing to root of AVL Tree as input and if valid, return true, and if false, return false.

a) Write a function that will print the even elements in each level of the binary search tree.  b) Write a function that will count total number of odd nodes of the tree.      10    /     \   6     13  /  \   /   \ 3 8 11 16   The output of the given tree when the function is applied:    10  6 8 16   Total number of odd nodes is 3. You have to answer both (a) and (b) in same code calling from main function. The base code is given bellow. Modify and write only the main function and the additional function needed to solve the problem in the answer script.   BST code:   #include<iostream> using namespace std;    struct node  {      int key;      struct node *left, *right;  };    // A utility function to search a given node bool search(struct node* root, int key)  {      // Base Cases: root is null or key is present at root      if (root == NULL)          return false;     else if(root->key == key)         return true;            // Key is greater than root's key      else if…

7. Draw an AVL tree of height 3 with the smallest possible number of nodes. Then draw an AVL tree of height 4 with the smallest possible number of nodes. In pseudocode, write a function that returns the number of nodes in the smallest possible AVL tree of height h. You may assume that only valid heights from -1 up to 25 will be supplied. Write your solution below. function minAvlSize (int height)

Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook.  Write a function, singleParent, that returns the number of nodes in abinary tree that have only one child. Add this function to the classbinaryTreeType and create a program to test this function. (Note: Firstcreate a binary search tree.)