ven the following C++ structure definition struct avl tree node double data; int balance; avl tree_ node *left; avl_tree_node right; 1i If you have an AVL search tree of nodes from the above structure, with a root node pointer called root, write the JAVA functions defined below a. void tree_print (avl_tree_node* root node) Precondition: root_node is the root pointer of the AVL tree or NULL if empty. Postcondition: The data from the nodes in the tree have been printed in-order n: root_node is the root pointer of the AVL tree or NULL if empty. Postcondition: All nodes at the root and below have been returned to the Heap b. void tree_clear (avl_tree_node & root_node) Preconditio (i.e. deleted), and root_node has been set to NULL