Authors:
Stuart Reges, Marty Stepp
Chapter:
Binary Trees
Exercise:
Exercises
Question:10 | ISBN:9780136091813 | Edition: 2
Question
Write a method called equals that accepts another binary tree of integers as a parameter and compares the two trees to see whether they are equal to each other. For example, if variables of type IntTree called t1 and t2 have been initialized, then t1.equals(t2) will return true if the trees are equal and false otherwise. Two empty trees are considered to be equal to each other.
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 equals method:
public boolean equals(IntTree other)
{
return equals(overallRoot, other.overallRoot);
}
private boolean equals(IntTreeNode root1, IntTreeNode root2)
{
if(root1 == null && root2 == null)
{
return true;
}
else if(root1 != null && root2 != null)
{
if(root1.data != root2.data)
{
return false;
}
else
{
return equals(root1.left, root2.left)
&& equals(root1.right, root2.right);
}
}
else
{
return false;
}
}