【LeetCode】226. Invert Binary Tree 二叉树翻转

/**
* 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)
{
//交换根节点的左、右子树
TreeNode* temp=root->left;
root->left=root->right;
root->right=temp;
//递归反转左、右子树
root->left=invertTree(root->left);
root->right=invertTree(root->right);
}
return root;
}
};