Given a binary tree. Invert it. For each node:
left child must become right child;
right child must become left child;
Definition of a tree:
Implement function Invert that returns the pointer to the inverted tree.
Function Invert returns res - pointer to the inverted tree.