Invert Binary Tree
easyGiven the `root` of a binary tree, invert the tree, and return its root.
Inverting a binary tree means swapping every left node with its corresponding right node.
Example 1
Input: root = [4,2,7,1,3,6,9]
Output: [4,7,2,9,6,3,1]
Explanation: The tree [4,2,7,1,3,6,9] becomes [4,7,2,9,6,3,1] after inversion.
Example 2
Input: root = [2,1,3]
Output: [2,3,1]
Explanation: The tree [2,1,3] becomes [2,3,1] after inversion.
Example 3
Input: root = []
Output: []
Explanation: An empty tree remains empty.
Constraints
The number of nodes in the tree is in the range [0, 100].-100 <= Node.val <= 100
Loading editor...
Test Cases
Click "Run" to execute your code against test cases
← PreviousMaximum Depth of Binary Tree→