public class TwoFourTree extends StringSSet implements LevelOrderTraversal {

/* your class MUST have a zero argument constructor. All testing will
use this ocnstructor to create a 2-3 tree.
*/
private MyNode root;
private int counter;

public TwoFourTree() {
   // add whatever code you want.
   root = new MyNode();
   counter = 0;
}

@Override
public int size() {
   return counter;
}

@Override
public String find(String x) {
   MyNode curr = root;
   int num;
   while (true) {
         num = curr.find(x);
         // // // System.out.println(Arrays.toString(curr.myData) + " " + curr.myData.length);

         if (num >= 0) {
            return curr.getData(num);
         } else if (curr.isLeaf()) {
            if (x.compareTo(curr.myData[0]) < 0) {
               return curr.myData[0];
            }
            if (x.compareTo(curr.myData[curr.myDataNum - 1]) > 0) {
               MyNode p = curr.myParent;
               while (p != null) {
                     for (int i = 0; i < p.myDataNum; i++) {
                        if (p.myData[i].compareTo(x) > 0) {
                           return p.myData[i];
                        }
                     }
                     p = p.myParent;
               }
               return null;
            }

            for (int i = 0; i < curr.myDataNum; i++) {
               if (curr.myData[i].compareTo(x) > 0) {
                     return curr.myData[i];
               }
            }

            break;
         }
         curr = getNextChild(curr, x);
   }
   return null;
}

Design and implement a series of experiments that compare the relat...