Data structure Course

Java Language

i need a driver program.

public static void main(String[] args)

{

ArrayList lNode = { 7, 3, 14, 23, 17, 18, 6, 1, 18, 2, 19};

BinaryTree tree = new BinaryTree(lNode);

......................

System.out.println(Depth of tree is : " + ??????????????);

}

}

Given a Binary search tree, you will design and implement a Java program that

1) Generate a Binary search tree from a list of data provided as argument.

2) Implement a recursive method that return the maximum depth of the binary constructed in 1. Be sure to test your implementation using different scenarios.