invert-binary-tree

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> of a binary tree, invert the tree, and return its root.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/invert1-tree.jpg" style="width: 500px; height: 165px;" />
<pre>
Input: root = [4,2,7,1,3,6,9]
Output: [4,7,2,9,6,3,1]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/invert2-tree.jpg" style="width: 500px; height: 120px;" />
<pre>
Input: root = [2,1,3]
Output: [2,3,1]
</pre>

Example 3:

<pre>
Input: root = []
Output: []
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[0, 100]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>

invertTree

Invert Binary Tree

Reverse Odd Levels of Binary Tree

reverse-odd-levels-of-binary-tree

反转二叉树的奇数层

Tree

Depth-First Search

Breadth-First Search

Binary Tree

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

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/invert1-tree.jpg" style="height: 165px; width: 500px;" />

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

示例 2：

<img alt="" src="https://assets.leetcode.com/uploads/2021/03/14/invert2-tree.jpg" style="width: 500px; height: 120px;" />

<pre>
输入：root = [2,1,3]
输出：[2,3,1]
</pre>

示例 3：

<pre>
输入：root = []
输出：[]
</pre>

&nbsp;

提示：

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