Subversion Repositories programming

        if( this.isLeaf() ) { return true; }

        if( Math.abs(left.height() - right.height()) < 2 ) { return true; }

        if( left.isBalanced() && right.isBalanced() ) { return true; }

    }

    */

        if( !this.contains(x) ) { return -1; }  //not found

        if( this.root.equals(x) ) { return 0; } //found here

        int ansLeft = left.level(x);

        int ansRight = right.level(x);

        int answer = Math.max(ansLeft,ansRight);

        if( answer >= 0 ) { return answer + 1; }

        return answer;

    }

    /*

    public boolean equals( Object object ) {

        //if we are not a BinaryTree, return false

        if( !(object instanceof BinaryTree) ) { return false; } 

        BinaryTree x = (BinaryTree)object; //typed instance of Object

        //temporary answer holding variables

        boolean ansLeft=false, ansRight=false;

        //check for the root data equality

        if( !this.root.equals(x.root) ) { return false; }

        //need this check to make sure that the recursive operations are ok

        if( left != null && right != null ) {

            //check the left

            if( left.equals(x.left) ) { ansLeft = true; }

            //check the right

            if( right.equals(x.right) ) { ansRight = true; }

        }

        //if both are null, we are still okay

        if( left == null && x.left == null ) { ansLeft = true; }

        if( right == null && x.right == null ) { ansRight = true; }

        //check that both left and right are okay

        if( ansLeft == true && ansRight == true ) { return true; }

        return false; //return false if any condition was not met

    }

    //printing methods ------------------------------------------------------

    public static void preOrderPrint( BinaryTree tree ) { 

        System.out.print( tree.root + " " );

        if( tree.left != null ) { preOrderPrint( tree.left ); }

        if( tree.right != null ) { preOrderPrint( tree.right ); }

    }

    public static void postOrderPrint( BinaryTree tree ) { 

        if( tree.left != null ) { postOrderPrint( tree.left ); }

        if( tree.right != null ) { postOrderPrint( tree.right ); }

        System.out.print( tree.root + " " );

    }

    public static void levelOrderPrint( BinaryTree tree ) { 

        Queue queue = new Queue();

        queue.enqueue(tree);

        while( !queue.isEmpty() ) {

            BinaryTree temp = (BinaryTree)queue.dequeue();

            System.out.print( temp.root + " " );

            if( temp.left != null ) { queue.enqueue(temp.left); }

            if( temp.right != null ) { queue.enqueue(temp.right); }

        }   

    }

    public static void inOrderPrint( BinaryTree tree ) { 

        if( tree.left != null ) { inOrderPrint(tree.left); }

        System.out.print( tree.root + " " );

        if( tree.right != null ) { inOrderPrint(tree.right); }

    }