Same Tree

题目描述:

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.

这个题目比较简单,2分钟就应该写出来。

public class Solution {
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if((p==null)^(q==null)||(p!=null&&q!=null&&p.val!=q.val))
        	return false;
        if(p==null&&q==null)
        	return true;
        return isSameTree(p.left, q.left)&&isSameTree(p.right, q.right);
    }
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/yeshiwu/article/details/51563529
文章标签: java leetcode tree
个人分类: leetcode
上一篇Recover Binary Search Tree
下一篇Symmetric Tree
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭