binary Tree equal method in java

Question

1.00/5 (1 vote)

See more:

hi i coded a function that checks two binary tree are equal or not

i dont know its correct or not please help!

Java

public static boolean equal(BinaryNode t1, BinaryNode t2){
      if(t1==null || t2==null) return false;
      else if(t1.element != t2.element) return false;
      else if(equal(t1.left,t2.left)) return false;
      else if(equal(t1.right,t2.right)) return false;
      else
          return true;

  }

Posted 10-Jan-12 4:18am

DominoBoy

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Nagy Vilmos · Accepted Answer · 2012-01-10T05:20:00

Firstly, I am not familiar with the class BinaryNode so I would guess it is your own.
The approach I would take is to make the class implement the equals method:

Java

public class BinaryNode {

    // stuff

    public int equals(Object obj) {
        if (this == obj) {
          return true;
        }
        if ( obj == null || !(obj instanceof BinaryNode)) {
            return false;
        }

        BinaryNode that = (BinaryNode)obj;
        if (this.element.equals(that.element)) {
            return false;
        }
        else if (this.left == null || this.left.equals(that.left)) {
            return false;
        }
        else if (this.right == null || this.right.equal(that.right)) {
            return false;
        }
        // must be the same
        return true;
    }

}