Question

In Java: Given the following binary tree class, write a recursive method called size() which will find the number of nodes in the subtree rooted at the current node:

class myBinaryTree{
int myValue;
myBinaryTree left;
myBinaryTree right;

myBinaryTree(int inValue) {myValue = inValue;}

public int size(){
<CODE WRITTEN HERE>
}

}

Answer 1

class myBinaryTree {
    int myValue;
    myBinaryTree left;
    myBinaryTree right;

    myBinaryTree(int inValue) {
        myValue = inValue;
    }

    public int size() {
        int count = 1;
        if (left != null) count += left.size();
        if (right != null) count += right.size();
        return count;
    }
}