Please help $me$ solve this $in$ java. $It$ also requires that the code should verify that the tree input has valid syntax Each $of$ the following errors should $be$ detected

Incomplete Tree

Data $is$ Not $an$ Integer

Missing Left $or$ right parenthesis

$It$ should $be$ three classes The program should consist of three classes. The first class should be the class that defines the

binary tree. It should be an immutable class with the following public methods:

$$ A constructor that accepts a string containing the preorder representation of a binary tree

and constructs a binary tree

$$ A constructor that accepts an array list of integers and constructs a balanced binary search

tree containing those values

$$ A method that outputs the binary tree in indented form

$$ A method that returns whether the tree is a binary search tree.

$$ A method that returns whether the tree is balanced

$$ A method that returns the height of the tree

$$ A method that returns an array list of the values in the tree

Additional private methods may be added as needed.

The second class should be a class that defines a checked exception that is thrown when a tree

with invalid syntax is input. The third class is the class that contains the main method and

accepts the user input and displays the results.

The previous answer did not work. I implemented some changes like for the final lines of code where it says

tree.root.left $=$ constructBalancedBST$($arr$,$start, mid $-1)$ I added $.$root to the end of it so that it was able to be assigned. If you answer this problem could you please attach documentation or a test run with the code working properly so I can look it over better! I really appreciate it thank you!