The Height of a Tree Can Be Obtained by Recursively

Multiple Choice

The height of a tree can be obtained by recursively computing the heights of its subtrees, while keeping track of the height of the deepest subtree. Given the Node class discussed in section 17.1 (partially shown below) , select an expression to complete the recursive method height, which is designed to return the height of the tree rooted at a node. class Node
{
Public Object data;
Public List<Node> children;
) . .
Public int height()
{
Int maxChildHeight = 0;
For (Node child : children)
{
Int childHeight = child.height() ;
If (childHeight > maxChildHeight)
MaxChildHeight = childHeight;
}
Return _________________;
}
}

A) maxChildHeight
B) maxChildHeight + 1
C) maxChildHeight + 2
D) maxChildHeight + height()