LeetCode 100. Same Tree

分类：Tree ；DFS

问题描述：

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.

方法思路：

递归方法

Java代码示例：

/**
 * 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) {
        return rcs(p,q);
    }
    private boolean rcs(TreeNode p,TreeNode q){
        if((p==null&&q!=null) || (p!=null && q==null)) return false;
        if(p==null && q==null) return true;
        if(p.val==q.val && rcs(p.left,q.left) && rcs(p.right,q.right)) return true;
        return false;
    }
}