er-cha-shu-de-jing-xiang-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.

flipTree

翻转二叉树

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给定一棵二叉树的根节点 <code>root</code>，请左右翻转这棵二叉树，并返回其根节点。

&nbsp;

示例 1：

<img alt="" src="https://pic.leetcode.cn/1694686821-qlvjod-%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.png" />

<pre>
输入：root = [5,7,9,8,3,2,4]
输出：[5,9,7,4,2,3,8]
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点数目范围在 <code>[0, 100]</code> 内</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>

&nbsp;

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

&nbsp;