Leetcode 226. Invert Binary Tree

Given the root of a binary tree, invert it by producing its mirror image—swap the left and right child of every node—and return the root. This is a straightforward tree-traversal problem that touches each node once.