Symmetric Tree

最新推荐文章于 2024-01-17 14:31:46 发布

Nereus_Li

最新推荐文章于 2024-01-17 14:31:46 发布

阅读量632

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签：二叉树递归

本文链接：https://blog.youkuaiyun.com/li_chihang/article/details/44699673

LeetCode 专栏收录该内容

113 篇文章

订阅专栏

本文将介绍如何通过递归方式判断给定的二叉树是否是对称的，即左右子树是否镜像对称。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

bool judgeSymmetric(TreeNode *L, TreeNode *R)
{
	if (!L&&!R)
		return true;
	else if (L&&R&&L->val == R->val)
		return judgeSymmetric(L->left, R->right) && judgeSymmetric(L->right, R->left);
	else
		return false;
}
bool isSymmetric(TreeNode *root) {
	if (root == NULL)
		return true;
	return judgeSymmetric(root->left, root->right);
}