EXERCISE D SHORT ANSwER 15 POINTS Consider the following definitions for a binar

Question

EXERCISE D SHORT ANSwER 15 POINTS Consider the following definitions for a binary tree: public class TreeNode public object item; public TreeNode left; public TreeNode right; public class Tree private TreeNode root Implement (recursively) the method numofNodesAtLevelRec for the class Tree to compute the number of nodes at a specific level (e.g the root node is at level 1, its children at level 2 etc.) in a binary tree. Returns number of nodes at the input level in this binary tree. public int int 1 i return numofNodesAtLevelRec root, Internal recursive method to implement numofNodesAtLevel". Returns the number of nodes of the subtree rooted at "currRoot". private int TreeNode currRoot, int 1)

Explanation / Answer

Program in JAVA:

public class Treenode
{
public object item;
public TreeNode left;
public TreeNode right;
int count ( )
{
tree right = get right node ( );
tree left = get left node ( );
int c = 1;
if (right!=null) c+=right count ( );
if (left!=null) c+=left count ( );
return c;
}
}

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.