class BTree {
  public class Node
  {
    int content;
    Node left, right;

    Node(int content,
            Node left,
            Node right)
    {
      this.content = content;
      this.left = left;
      this.right = right;
    }

    public String toString()
    {
      return ""+content;
    }
  }

  Node root;

  BTree() {
    this.root = null;
  }

  BTree(int value) {
    this.root =
     new Node(value, null, null);
  }

  void insertSorted(int value)
  {
    if (root == null)
    {
      root = new Node(value, null, null);
    }
    else
    {
      insertSorted(value, root);
    }
  }

  void insertSorted(int value, Node e)
  {
    if (value < e.content)
    {
      if (e.left == null)
      {
        e.left = new Node(value, null, null);
      }
      else
      {
        insertSorted(value, e.left);
      }
    }
    else
    {
      if (e.right == null)
      {
        e.right = new Node(value, null, null);
      }
      else
      {
        insertSorted(value, e.right);
      }
    }
  }

  void printInOrder()
  {
    System.out.print("In-Order: (");
    printInOrder(root);
    System.out.println(")");
  }

  void printInOrder(Node e)
  {
    if (e != null)
    {
      printInOrder(e.left);
      System.out.print(e.content+" ");
      printInOrder(e.right);
    }
  }

  List getNodeList()
  {
    List l = new List();
    getNodeList(l, root);
    return l;
  }

  void getNodeList(List l, Node e)
  {
    if (e != null)
    {
      getNodeList(l, e.left);
      l.insertLast(e.content);
      getNodeList(l, e.right);
    }
  }


  public static void main(String[] args)
  {
    BTree tree = new BTree();
    tree.insertSorted(8);
    tree.insertSorted(3);
    tree.insertSorted(6);
    tree.insertSorted(2);
    tree.insertSorted(13);
    tree.insertSorted(-1);
    tree.insertSorted(5);
    tree.insertSorted(7);
    tree.insertSorted(4);
    tree.insertSorted(10);

    tree.printInOrder();

    List l = tree.getNodeList();
    l.print();
  }
}