To implement BSTSet as a binary search tree the following private Node inner class will be used:

private class Node
{
  private int key;
  private Node left;
  private Node right;

  private Node(int k)
  {
    key = k;
    left = null;
    right = null;
  }
}