Given the root of a binary tree, invert it — every left child becomes a right child and vice versa, all the way down — and return the new root.
Example
Input: root = [4, 2, 7, 1, 3, 6, 9] Output: [4, 7, 2, 9, 6, 3, 1]