Need help with this in Java.

The problem involves writing a constructor to read in the preorder representation of a binary tree Given the binary tree shown below:

Its preorder representation is $(53(28(11**)(41**))(83(67**)*))$ The

asterisks represent null children.

Need to implement parsing logic here that constructs the binary tree

from the preorder representation, and handles syntax validation.

Everything digit after the $\text{'}(\text{'}$ is either a new node $($parent node$)$ or left node $.$ If number of $"(\text{'}$ matches number of $\text{'})\text{'}$ that equals to one full node.

One we get the the last $\text{'})\text{'}$ and it all right and left delimeters match it is a tree.