Answer Happy

Question 2: Binary Tree (15 points) Given
interface BinNode {
public int value();
public void setValue(int
v);
public BinNode left();
public BinNode right();
public boolean isLeaf();
}
Write a recursive function that traverses a binary tree and
prints the value of every node which has at least two children.
public int AtLeastTwoChildren(BinNode root) {