public class IntTreeNode {
    int value;
    IntTreeNode right = null;
    IntTreeNode left = null;


    public IntTreeNode(int value) {

        this.value = value;
        this.right = null;
        this.left = null;
    }

    public boolean addToChildren(int numberToAdd) {

        if (this.value == numberToAdd) {
            return false;
        }

        if (numberToAdd < this.value) {
            if (this.left == null) {
                this.left = new IntTreeNode(numberToAdd);
                return true;
            } else {
                this.left.addToChildren(numberToAdd);
            }

        } else if (numberToAdd > this.value) {
            if (this.right == null) {
                this.right = new IntTreeNode(numberToAdd);
                return true;
            } else {
                this.right.addToChildren(numberToAdd);
            }
        }

        return false;
    }

    public boolean searchIfChildrenContain(int valueToFind) {

        return (this.value == valueToFind) || (this.right != null ? this.right.searchIfChildrenContain(valueToFind) : false) || (this.left != null ? this.left.searchIfChildrenContain(valueToFind) : false);
    }

    public int countChildrenNodes() {

        return 1 + (this.right != null ? this.right.countChildrenNodes() : 0) + (this.left != null ? this.left.countChildrenNodes() : 0);
    }

    public int maxHeightOfChildren() {


        return 1 + (Math.max((this.right != null ? this.right.maxHeightOfChildren() : 0), (this.left != null ? this.left.maxHeightOfChildren() : 0)));
    }

    public void printPreOrderChildren() {

        System.out.print(this.value + ", ");
        if (this.left != null){
            this.left.printPreOrderChildren();
        }
        if (this.right != null){
            this.right.printPreOrderChildren();
        }

    }


    public void paintChildrenInOrder() {

        if (this.left != null ){
            this.left.paintChildrenInOrder();
        }

        System.out.print(this.value + " ");

        if (this.right != null ){
            this.right.paintChildrenInOrder();
        }
    }

    public void paintChildrenInOrderDown() {

        if (this.right != null ){
            this.right.paintChildrenInOrderDown();
        }
        System.out.print(this.value + " ");
        if (this.left != null ){
            this.left.paintChildrenInOrderDown();
        }




    }
}


@@ -1,12 +1,37 @@
+import java.util.Queue;%0A%0A
 public class
@@ -1703,32 +1703,33 @@
 is.left != null)
+ 
 %7B%0A            th
@@ -1802,16 +1802,17 @@
 != null)
+ 
 %7B%0A      
@@ -1935,34 +1935,34 @@
 his.left != null
- 
 )
+ 
 %7B%0A            th
@@ -2071,34 +2071,34 @@
 is.right != null
- 
 )
+ 
 %7B%0A            th
@@ -2215,34 +2215,34 @@
 is.right != null
- 
 )
+ 
 %7B%0A            th
@@ -2365,10 +2365,10 @@
 null
- 
 )
+ 
 %7B%0A  
@@ -2427,16 +2427,1042 @@
     %7D%0A%0A%0A
+    %7D%0A%0A    public int minValueOfChildren(int min) %7B%0A%0A        if (this.value %3C min) %7B%0A            min = this.value;%0A        %7D%0A%0A        if (this.right == null && this.left == null) %7B%0A            return min;%0A        %7D%0A%0A        return Math.min((this.right != null ? this.right.minValueOfChildren(min) : min), (this.left != null ? this.left.minValueOfChildren(min) : min));%0A%0A%0A    %7D%0A%0A    public int maxValueOfChildren(int max) %7B%0A%0A        if (this.value %3E max)%7B%0A            max = this.value;%0A        %7D%0A        if (this.right == null && this.left == null)%7B%0A            return max;%0A        %7D%0A%0A        return Math.max((this.right != null ? this.right.maxValueOfChildren(max):max),(this.left != null ? this.left.maxValueOfChildren(max):max));%0A    %7D%0A%0A    public void pushValues(Queue%3CInteger%3E myTree_values) %7B%0A%0A        if (this.left != null)%7B%0A            this.left.pushValues(myTree_values);%0A        %7D%0A%0A        myTree_values.add(this.value);%0A%0A        if (this.right != null)%7B%0A            this.right.pushValues(myTree_values);%0A        %7D%0A%0A%0A
 %0A%0A    %7D%0A
@@ -3463,9 +3463,8 @@
     %7D%0A%7D%0A
-%0A

Update IntTreeNode.java