// Creates a tree of integer and prints its elements in different orders.

public class IntTreeClient {
    public static void main(String[] args) {
        // for the debugger
        IntTreeNode dummy = new IntTreeNode(-1);

        // build the tree we want
        IntTreeNode root = new IntTreeNode(17);
        root.left = new IntTreeNode(41);
        root.right = new IntTreeNode(9);
        root.left.left = new IntTreeNode(29);
        root.right.left = new IntTreeNode(81);
        root.right.right = new IntTreeNode(40);

        IntTree tree = new IntTree();
        tree.print();

        System.out.println(tree.contains(29));
        System.out.println(tree.contains(6));
    }
}