Invert Binary Tree
Easy
LC #226
dfsrecursionNot attempted yet
Given the root of a binary tree, mirror it: swap the
left and right child of every node. Return the root of the
inverted tree.
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
- 0 ≤ number of nodes ≤ 2 · 10^4
- -10^5 ≤ Node.val ≤ 10^5