LeetCode226. 翻转二叉树

翻转一棵二叉树。

示例：

输入：

 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) {}
 * };
 */
static const int _ = []() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    return 0;
}();
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if(root == NULL)
            return NULL;
        TreeNode* node = root->left;
        root->left = root->right;
        root->right = node;
        this->invertTree(root->left);
        this->invertTree(root->right);
        return root;
    }
};