// Class to store a single node of a binary tree of integers

public class IntTreeNode {
   public int data;
   public IntTreeNode left;
   public IntTreeNode right;
   
   // Constructs a node with the given data and left and right subtrees
   public IntTreeNode(int data, IntTreeNode left, IntTreeNode right) {
      this.data = data;
      this.left = left;
      this.right = right;
   }

   // Constructs a leaf node with the given data   
   public IntTreeNode(int data) {
      this(data, null, null);
   }
}