Write an algorithm (in Java code) which has a tight bound runtime of O(n2 ). Your algorithm must:

Include at least one of the traversals we discussed in class on a BST

Store a String in each BST node

Do any simple String concatenation operation during the traversal.

Include your .java files to compile and run your code. Include instructions on how to run your O(n2 ) method with a static void main method and test input.