dui-cheng-de-er-cha-shu-lcof

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

English description is not available for the problem. Please switch to Chinese.

checkSymmetricTree

判断对称二叉树

Tree

Depth-First Search

Breadth-First Search

Binary Tree

请设计一个函数判断一棵二叉树是否 轴对称 。

&nbsp;

示例 1：

<img alt="" src="https://pic.leetcode.cn/1694689008-JaaRdV-%E8%BD%B4%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%911.png" />

<pre>
输入：root = [6,7,7,8,9,9,8]
输出：true
解释：从图中可看出树是轴对称的。</pre>

示例 2：

<img alt="" src="https://pic.leetcode.cn/1694689054-vENzHe-%E8%BD%B4%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%912.png" />

<pre>
输入：root = [1,2,2,null,3,null,3]
输出：false
解释：从图中可看出最后一层的节点不对称。</pre>

&nbsp;

提示：

<code>0 &lt;= 节点个数 &lt;= 1000</code>

注意：本题与主站 101 题相同：<a href="https://leetcode-cn.com/problems/symmetric-tree/">https://leetcode-cn.com/problems/symmetric-tree/</a>

&nbsp;