leetcode_226_Invert Binary Tree(C++)(easy)

4
/   \
2     7
/ \   / \
1   3 6   9

4
/   \
7     2
/ \   / \
9   6 3   1

思路一：利用递归的思想

/**
 * 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 == NULL)
            return root;
        TreeNode* tmp;
        tmp = root -> left;
        root -> left = root -> right;
        root -> right = tmp;
        
        invertTree(root -> left);
        invertTree(root -> right);
        return root;
        
    }
};