why is my code is not working import java.util.ArrayList;

class TreeNode $\{$

E element;

TreeNode left;

TreeNode right;

TreeNode$($E element$)\{$

this.element $=$ element;

this.left $=$ null;

this.right $=$ null;

$\}$

$\}$

class BinaryTree$>\{$

TreeNode root;

public BinaryTree$()\{$

this.root $=$ null;

$\}$

public boolean insert$($E e$)\{$

if $($root $==$ null$)\{$

root $=$ new TreeNode$<>($e$)$;

return true;

$\}$ else $\{$

TreeNode parent $=$ null;

TreeNode current $=$ root;

while $($current $!=$ null$)\{$

parent $=$ current;

if $($e$.$compareTo$($current$.$element$)<0)\{$

current $=$ current.left;

$\}$ else if $($e$.$compareTo$($current$.$element$)>0)\{$

current $=$ current.right;

$\}$ else $\{$

return false; $//$ Duplicate node not inserted

$\}$

$\}$

if $($e$.$compareTo$($parent$.$element$)<0)\{$

parent.left $=$ new TreeNode$<>($e$)$;

$\}$ else $\{$

parent.right $=$ new TreeNode$<>($e$)$;

$\}$

return true; $//$element inserted successfully

$\}$

$\}$

$//$ Method to find depth of the tree

public int depth$($TreeNode node$)\{$

if $($node $==$ null$)$ return $-1$;

return $1+$ Math.max$($depth$($node$.$left$),$ depth$($node$.$right$))$;

$\}$

$//$ Method to find maximum value in the tree

public E max$($TreeNode node$)\{$

if $($node $==$ null$)$ return null;

E leftMax $=$ max$($node$.$left$)$;

E rightMax $=$ max$($node$.$right$)$;

E max $=$ node.element;

if $($leftMax $!=$ null && leftMax.compareTo$($max$)>0)$ max $=$ leftMax;

if $($rightMax $!=$ null && rightMax.compareTo$($max$)>0)$ max $=$ rightMax;

return max;

$\}$

$//$ Method to find the sum of all nodes

public double treeSum$($TreeNode node$)\{$

if $($node $==$ null$)$

return $0$;

return $($Double$)$ node.element $+$ treeSum$($node$.$left$)+$ treeSum$($node$.$right$)$;

$\}$

$//$ Method to find the average of all nodes

public double treeAverage$($TreeNode node, int$[]$ count$)\{$

if $($node $==$ null$)$ return $0$;

count$[0]++$;

return $($Double$)$ node.element $+$ treeAverage$($node$.$left, count$)+$ treeAverage$($node$.$right, count$)$;

$\}$

$//$ Method to check if the tree is balanced

public boolean isBalanced$($TreeNode node$)\{$

if $($node $==$ null$)$ return true;

int leftDepth $=$ depth$($node$.$left$)$;

int rightDepth $=$ depth$($node$.$right$)$;

return $($Math$.$abs$($leftDepth $-$ rightDepth$)>1||!$isBalanced$($node$.$left$)||!$isBalanced$($node$.$right$))$;

$\}$

public void build$\_$from$\_$node$\_$lists$($double$[]$ pre, double$[]$ in$,$ int size$)\{$

$\}$

$\}$public class BinaryTreeTest $\{$

public static void main$($String$[]$ args$)\{$

$//$ Sample data arrays for pre$-$order and in$-$order traversal

double$[]$ pre$1=\{2,1,3\}$;

double$[]$ in$1=\{1,2,3\}$;

BinaryTree tree $=$ new BinaryTree$()$;

$//$tree$.$build$\_$from$\_$node$\_$lists$($pre$1,$in$1)$;

int$[]$ pre$2=\{1,2,4,8,5,9,3,6,10,11,7,12\}$ ; $//$ pre order

int$[]$ in$2=\{8,4,2,9,5,1,10,6,11,3,7,12\}$ ;

$//$ in order

$//$return build$\_$from$\_$node$\_$lists$($pre$2,$ in$2,12)$;

int size$3=57$;

double$[]$ pre$3=\{0\mathrm{.}185038,0\mathrm{.}394342,0\mathrm{.}291092,0\mathrm{.}289448,0\mathrm{.}101709,0\mathrm{.}0611125,0\mathrm{.}193208,0\mathrm{.}13517,0\mathrm{.}0404296,0\mathrm{.}410769,0\mathrm{.}0198583,0\mathrm{.}432688,0\mathrm{.}0674109,0\mathrm{.}151873,0\mathrm{.}14349,0\mathrm{.}286818,0\mathrm{.}071119,0\mathrm{.}170354,0\mathrm{.}0670367,0\mathrm{.}44319,0\mathrm{.}0682843,0\mathrm{.}270964,0\mathrm{.}369207,0\mathrm{.}461848,0\mathrm{.}427017,0\mathrm{.}377756,0\mathrm{.}0485934,0\mathrm{.}0667142,0\mathrm{.}108895,0\mathrm{.}153658,0\mathrm{.}00263633,0\mathrm{.}222634,0\mathrm{.}094924,0\mathrm{.}195702,0\mathrm{.}170448,0\mathrm{.}364803,0\mathrm{.}378102,0\mathrm{.}440015,0\mathrm{.}147172,0\mathrm{.}0208332,0\mathrm{.}340395,0\mathrm{.}131731,0\mathrm{.}275594,0\mathrm{.}390628,0\mathrm{.}317047,0\mathrm{.}108642,0\mathrm{.}393182,0\mathrm{.}307225,0\mathrm{.}159842,0\mathrm{.}292226,0\mathrm{.}126009,0\mathrm{.}363135,0\mathrm{.}183877,0\mathrm{.}228193,0\mathrm{.}449523,0\mathrm{.}042972,0\mathrm{.}462529\}$;

double $[]$in