aloalgoInvert Binary Tree
Easy
You are given the root of a binary tree.
Your task is to invert the binary tree.
Note that:
- Inverting a binary tree means swapping the left and right children of every node.
- This operation should be applied recursively to all nodes, effectively mirroring the tree structure.
Do not return anything, instead modify the input tree.
Example 1
Input
Output
Example 2
Input
Output
Example 3
Input
Output
Example 4
Input
None
Output
None
Explanation:
An empty tree remains empty after inversion.
Input
Output