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

LeetCode - Same Tree

时间:2015-04-13 00:17:28      阅读:130      评论:0      收藏:0      [点我收藏+]

标签:

          Description:

                         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.

                         判断两棵树是不是相等。考虑null的情况。

          

/**
 * Definition for binary tree
 * 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;
        else if(p==null&&q!=null || p!=null&&q==null)
        	return false;
        else {
        	if(p.val != q.val)
        		return false;
        	else {
        		return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
        	}
        }
        
    }
}

 

LeetCode - Same Tree

标签:

原文地址:http://www.cnblogs.com/wxisme/p/4420868.html

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