Directions: You are not allowed to add functions nor parameters. 1. Construct a Binary Tree using the array elements. If the current element is less than the node, place the element on the left branch, else place it on the right branch. 2. Once the binary tree is constructed, perform in-order traversal of the binary tree(use recursion).

struct BTreeNode { struct BTreeNode *leftnode; struct BTreeNode *rightnode; int element; };

void inorder(struct BTreeNode *node, int *array){

}

void insert_element(struct BTreeNode **node, int element){

}

void tree_sort(int *array, int size) { }

void free_btree(struct BTreeNode **node){

}