LeetCode 226. Invert Binary Tree

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     TreeNode* invertTree(TreeNode* root) {
13         if(!root) return root;
14         TreeNode* tmp = root->left;
15         root->left = root->right;
16         root->right = tmp;
17         invertTree(root->left);
18         invertTree(root->right);
19         return root;
20     }
21 };