cannot use c++ STL library and must code in c++, cannot use any built in functions, everything must be coded by itself. Need help getting started, there is c d e and f to this problem but I just need help getting started... Please help me on this problem, I am really stuck.

Begin by implementing a BST for integers. The underlying structure is a linked list. You need these methods: a. i. BSTO: Constructor ii. void put (int)- Inserts a value into the BST. ii Void put(intll a)-Inserts an entire array 'a' into the BST. iv. int search(int key)-Searches for a value in the BST. If found, return the key. If not found, return O and print 'Value not found!' to the console. Additionally, print out the total number of comparisons needed (whether the key is found or not) int returnSize()-returns the total number of nodes in the BST v. See Slides 3-10 on Binary Search Trees to see how a BST might be structured with these methods. The implementation is effectively the same as shown. Now, we will attempt to balance the tree after the values have been inserted. Implement these methods: b. i intl a sortedTree) Outputs the tree in sorted order of an array. ii. BST balanceTreeOne();--Balances the tree by creating a new BST and inserting the values of the sorted array in a way such that the tree height is balanced. he the w Begin by implementing a BST for integers. The underlying structure is a linked list. You need these methods: a. i. BSTO: Constructor ii. void put (int)- Inserts a value into the BST. ii Void put(intll a)-Inserts an entire array 'a' into the BST. iv. int search(int key)-Searches for a value in the BST. If found, return the key. If not found, return O and print 'Value not found!' to the console. Additionally, print out the total number of comparisons needed (whether the key is found or not) int returnSize()-returns the total number of nodes in the BST v. See Slides 3-10 on Binary Search Trees to see how a BST might be structured with these methods. The implementation is effectively the same as shown. Now, we will attempt to balance the tree after the values have been inserted. Implement these methods: b. i intl a sortedTree) Outputs the tree in sorted order of an array. ii. BST balanceTreeOne();--Balances the tree by creating a new BST and inserting the values of the sorted array in a way such that the tree height is balanced. he the w