trie tree

class Node {
  Node left;
  Node right;
  int value;

  public Node(int value) {
    this.value = value;
  }
}

public class BST {
  public Node root;

  public BST() {}

  public void insert(int value) {
    if (root == null) {
      root = new Node(value);
    } else {
      Node current = root;
      while (current != null) {
        if (value > current.value) {
          if (current.right == null) {
            current.right = new Node(value);
            break;
          } else {
            current = current.right;
          }
        } else {
          if (current.left == null) {
            current.left = new Node(value);
            break;
          } else {
            current = current.left;
          }
        }
      }
    }
  }
}