class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if(root == NULL)
return NULL;
root->right = invertTree(root->right);
root->left = invertTree(root->left);
swap(root->left,root->right);
return root;
}
};
翻转二叉树
最新推荐文章于 2024-05-09 15:44:08 发布