码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode - Same Tree

时间:2016-01-10 10:28:58      阅读:144      评论:0      收藏:0      [点我收藏+]

标签:

题目:

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.

思路:

递归

package tree;

public class SameTree {

    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null && q == null) return true;
        if (p == null || q == null) return false;
        return p.val == q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub

    }

}

 

LeetCode - Same Tree

标签:

原文地址:http://www.cnblogs.com/shuaiwhu/p/5117804.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!