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

LeetCode——Symmetric Tree

时间:2014-06-15 19:49:35      阅读:176      评论:0      收藏:0      [点我收藏+]

标签:leetcode

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric:

    1
   /   2   2
 / \ / 3  4 4  3

But the following is not:

    1
   /   2   2
   \   

3 3

中文:给定一二叉树,检查它是否是它自己的镜像(例如,以中心对称)。

递归:

	public boolean isSymmetric(TreeNode root) {
		if(root == null)
			return true;
		return isSymmetric(root,root);
	}
	public boolean isSymmetric(TreeNode left,TreeNode right) {
		if(left == null && right == null)
			return true;
		else if(left == null || right == null)
			return false;
		return left.val == right.val && isSymmetric(left.left,right.right) && isSymmetric(left.right,right.left);
	}



LeetCode——Symmetric Tree,布布扣,bubuko.com

LeetCode——Symmetric Tree

标签:leetcode

原文地址:http://blog.csdn.net/laozhaokun/article/details/30271621

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