Same Tree

Same Tree Sep 3 '12

Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

 bad one recursive.

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(p==null && q==null) return true;
        else if( p==null || q==null) return false;
        if( p.val != q.val) return false;
        else return isSameTree( p.left, q.left) && isSameTree(p.right, q.right);
        
    }
}