easyTrees
Invert Binary Tree
## Problem
Given the root of a binary tree, invert the tree, and return its root.
> **Input/Output format:** The tree is given and returned as a level-order list where `None` represents a missing node.
Given the root of a binary tree, invert the tree, and return its root.
> **Input/Output format:** The tree is given and returned as a level-order list where `None` represents a missing node.
Examples
Input
root = [4,2,7,1,3,6,9]
Output
[4,7,2,9,6,3,1]
Left and right subtrees are swapped at every level.
Input
root = [2,1,3]
Output
[2,3,1]
Children swapped.
Input
root = []
Output
[]
Empty tree.
Constraints
The number of nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100
Python
Loading...