Invert Binary Tree

CREATED TIME: Feb 09, 2020 11:14 PM UPDATED TIME: Feb 09, 2020 11:15 PM 난이도: Easy

/** * 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 NULL; }

        swap(root->left, root->right);
        invertTree(root->left);
        invertTree(root->right);
        
        return root;
    }
};