You will create a binary search tree given its preOrder traversal. Recall that in a preOrder traversal the node is visited before its children. You need to fill in the code for the constructor method. I've given you a toString method to help with debugging. For example the following array [7,3,1,5,10,8,12] would result in the following binary search tree Tree: 7 3 1 5 10 8 12 public BinaryTree (int[] preOrder) This method should initialize the root variable so that it points to the binary tree with the given preOrder traversal. Activate Windows Go to Settings to activate