leetcode 226. 翻转二叉树

c++

class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if (!root) return root;
        TreeNode *tmp = root->left;
        root->left = root->right;
        root->right = tmp;
        invertTree(root->left);
        invertTree(root->right);
        return root;
    }
};

js

var invertTree = function(root) {
    if (!root) return root;
    var node = root.left;
    root.left = root.right;
    root.right = node;
    invertTree(root.left);
    invertTree(root.right);
    return root;
};