125. Invert/Flip Binary Tree

PRO

Easy

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: root = [4,2,7,1,3,6,9]

Output: [4,7,2,9,6,3,1]

Explanation: The tree is inverted such that the left and right subtrees of each node are swapped.

Example 2:

Input: root = [2,1,3]

Output: [2,3,1]

Explanation: The tree with root 2 has its left child 1 and right child 3 swapped.

Example 3:

Input: root = []

Output: []

Explanation: An empty tree remains an empty tree after inversion.

Constraints:

•
•

Time Complexity

O(n)

Space Complexity

O(h)

125. Invert/Flip Binary Tree

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

125. Invert/Flip Binary Tree

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Companies

Hint

Use Cases