//226. 翻转二叉树
class Solution {
public:
void dfs(TreeNode* node) {
if (node == NULL) return;
swap(node->left, node->right);
dfs(node->left);
dfs(node->right);
}
TreeNode* invertTree(TreeNode* root) {
dfs(root);
return root;
}
};
LeetCode226. 翻转二叉树
最新推荐文章于 2024-09-12 19:02:20 发布