Swap left and right children recursively.
For each node, invert its subtrees and swap them.
Inversion is defined locally per node: left and right are exchanged at every level.
Swap left and right children recursively.
For each node, invert its subtrees and swap them.
Inversion is defined locally per node: left and right are exchanged at every level.