/**
 * [Link:] https://leetcode.com/problems/invert-binary-tree/
 */

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if(!root)
            return root;
        if(!root->left && !root->right)
            return root;
        TreeNode* tmp = root->left;
        root->left  = invertTree(root->right);
        root->right = invertTree(tmp);
        return root;
    }
};

Add solution for 226. Invert Binary Tree.
Add solution for 226. Invert Binary Tree.