data structure

JAVA LANGUAGE

Using the classes and methods implemented in the Lab OR the code posted on Moodle where class Node includes four instance variables: public int iData; // data item (key) public double dData; // data item public Node leftChild; // this node's left child public Node rightChild; // this node's right child class BST_Tree that includes: private Node Root; Do the following: 1. Given a sorted array. Implement createBST function that creates a balanced BST using array elements. 2. implement function delete AllLeaves that removes all leaves in a BST. 3. implement function sum that sum all node values Note: 1. Your program should be well-structures and well-documented. 2. Indicate the expected time and space complexity of your program