Leetcode-Symmetric Tree

最新推荐文章于 2020-12-28 22:34:43 发布

猪小小_up

最新推荐文章于 2020-12-28 22:34:43 发布

阅读量534

点赞数

分类专栏： leetcode 文章标签： leetcode Symmetric Tree 算法程序员面试算法

本文链接：https://blog.csdn.net/xiao1ni1zi/article/details/40536897

版权

leetcode 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

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

For example, this binary tree is symmetric:

But the following is not:

Note:
Bonus points if you could solve it both recursively and iteratively.

import java.util.LinkedList;

public class Solution {
    public boolean recursive(TreeNode left, TreeNode right){
		if( left == null && right == null )
			return true;
		if( left == null || right == null )
			return false;
		if( left.val != right.val )
			return false;
		return recursive(left.left,right.right)&&recursive(left.right,right.left);
	}
    public boolean iterative(TreeNode root){
		LinkedList<TreeNode> leftQueue = new LinkedList<TreeNode>();
		LinkedList<TreeNode> rightQueue = new LinkedList<TreeNode>();
		leftQueue.add(root.left);
		rightQueue.add(root.right);
		while( !leftQueue.isEmpty() && !rightQueue.isEmpty() ){
			TreeNode currLeft; TreeNode currRight;
			currLeft = leftQueue.remove();
			currRight = rightQueue.remove();
		    if( currLeft == null && currRight == null )
				continue;
			if( currLeft == null || currRight == null )
				return false;
			if( currLeft.val != currRight.val )
				return false;
			leftQueue.add(currLeft.left);leftQueue.add(currLeft.right);
			rightQueue.add(currRight.right);rightQueue.add(currRight.left);
		}
		return true;
	}
    public boolean isSymmetric(TreeNode root) {
        if( root == null ) 
			return true;
		return recursive(root.left, root.right);
// 		return iterative(root);
    }
}