Skip to content
CodeShare
All problems

Invert Binary Tree

Mirror a binary tree from left to right.

EasyTrees

Given the root of a binary tree, swap the left and right children of every node, and return the root.

Trees are written level by level, with null for a missing child.

Examples

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

Constraints

  • The tree has between 0 and 100 nodes.
  • -100 <= Node.val <= 100