翻转二叉树

翻转二叉树
/*
解题思路：
翻转每一棵树的左右子树根节点
/
void _invertTree(struct TreeNode root){
if(root){
struct TreeNode* tmp = root->left;
root->left = root->right;
root->right = tmp;
_invertTree(root->left);
_invertTree(root->right);
}
}

struct TreeNode* invertTree(struct TreeNode* root){
_invertTree(root);
return root;
}