// Make a big tree full of data and nodes that // we

// Make a big tree full of data and nodes that // we can do something useful with. TernaryTree root = createBigTree(); // Your task is to print out the largest element of the tree. // You must use one of the methods from Tree structure. That may // be the visitor pattern, depth-first search, breadth-first // search, or any other method from (Chapter 17 of java late object book)to find the // largest element of a tree. // You may add code to TernaryTree, but do not remove or modify(the code for the TernaryTreeTester and TernaryTree is given) // any existing methods. You may add code to the inner Node class, // but do not modify the existing fields. You may add code to this // file, but do not modify the ‘createBigTree()’ method.