// Class for storing a single node of a binary tree of ints

public class IntTreeNode {
  public int data;
  public IntTreeNode left;
  public IntTreeNode right;

  public IntTreeNode(int data) {
    this.data = data;
  }

  // binary tree -> root node, with a left and right binary tree.
  public IntTreeNode(int data, IntTreeNode left, IntTreeNode right) {
    this.data = data;
    this.left = left;
    this.right = right;
  }
}