The Height of a Tree Can Be Obtained by Recursively

question 13

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()

---

Definitions:

Canada

A country in North America known for its vast landscapes, multicultural society, and bilingual status with English and French as official languages.

Ethnic Entrepreneur

An individual who creates and operates a business venture, leveraging cultural knowledge and networks within their ethnic or immigrant community for success.

Little Italy

A term referring to an urban area with a high concentration of Italian immigrants or descendants, often characterized by Italian cultural traits.

Critical Race Theory

Holds that racism is often the outcome of common practices that are embedded in Canada’s political, legal, and other institutions but that many people, especially those in dominant positions, are not aware of.