class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
travel(root);
return root;
}
void travel(TreeNode* root) {
if (root != NULL) {
TreeNode* p = root->left;
root->left = root->right;
root->right = p;
travel(root->left);
travel(root->right);
}
}
};
LeetCode 226. 翻转二叉树
最新推荐文章于 2024-07-13 13:36:16 发布