payal-kothari
8/9/2017 - 6:33 PM

From https://leetcode.com/problems/same-tree/description/ // Recursive check if two binary trees are same

From https://leetcode.com/problems/same-tree/description/ // Recursive check if two binary trees are same

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
       if(p == null && q == null) 
           return true;
       if((p == null && q != null) || ((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);
    }
}