BST

public class BST {
    public boolean insert(BinaryTreeNode root, String value) {
      if(root == null) {
        root = new BinaryTreeNode(value, null, null);
      } else {
          if(root.value.compareTo(value) > 0) {
            insert(root.left, value);
          } else if(root.value.compareTo(value) <= 0) {
            insert(root.right, value);
          }
      }
    }

    public void delete()
}

class BinaryTreeNode {
  String value;
  BinaryTreeNode left;
  BinaryTreeNode right;

  BinaryTreeNode(String value) {
    this.value = value;
  }

  BinaryTreeNode(String value, BinaryTreeNode left, BinaryTreeNode right) {
    this.value = value;
    this.left = left;
    this.right = right;
  }
}