Create a function that uses  Node * pointing to root of AVL Tree as an input and returns the height of the AVL tree in O(log(n)

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…

python: In a binary search tree, write another way of function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p):     root=p     def helper(root, l, r):         if not root:             return True         if not (left<root.val and root.val<right):             return False         return helper(root.l, l, root.val) and helper(root.r, root.val, r)       return helper(root, float('-inf'), float('inf'))

Given a reference to a binary tree t. I am trying to write a python function using recursion that will check if an integer called k is stored in a leaf node in the tree. if not stored it should return false but if it is I want it to return True. starting function: def in_leaf(t,k):