leetCode题解之反转二叉树

 1 TreeNode* invertTree(TreeNode* root) {
 2         
 3         if(root == NULL )
 4             return NULL;
 5         
 6         
 7         TreeNode* temp;
 8         temp = root->left;
 9         root->left = invertTree(root->right);
10         root->right = invertTree(temp);
11         
12         return root;
13         
14     }