Authors:
Stuart Reges, Marty Stepp
Chapter:
Binary Trees
Exercise:
Exercises
Question:8 | ISBN:9780136091813 | Edition: 2
Question
Write a method called isFull that returns true if a binary tree is full and false if it is not. A full binary tree is one in which every node has 0 or 2 children. For example, reference trees #1 and #2 are not full, but #3 is full. By definition, the empty tree is considered full.
Add the above method to the IntTree class from this chapter. You may define additional private methods to implement your public method if necessary. Several problem descriptions refer to the following reference binary trees:
Answer
Implementation of isFull method:
public boolean isFull()
{
if(overallRoot == null)
return true;
else
return isFull(overallRoot);
}
private boolean isFull(IntTreeNode root)
{
if(root == null)
{
return false;
}
else if(isFull(root.left) && isFull(root.right))
{
return true;
}
else if(root.left == null && root.right == null)
{
return true;
}
else
{
return false;
}
}