LeetCode100---Same Tree

Quetion:

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.

这道题比较简单,还是用递归,只贴出代码

public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null && q == null) {
            return true;
        }
        if (p == null || q == null) {
            return false;
        }
        boolean flag = false;
        if(p.val == q.val){
            flag = isSameTree(p.left, q.left) && isSameTree(p.right, q.right) ;
        }        
        return flag;
    }
}
原文地址:https://www.cnblogs.com/miaowu1314/p/6251421.html