Invert Binary Tree Problem
Problem Given the root of a binary tree, invert the tree, and return its root. OR Change a tree so that the roles of the left and right pointers are swapped at every node. Example Example 1 Given binary tree 1 / \ 2 3 / \ / \ 4 5 6 7 ...