面试经典150题 P226 翻转二叉树

---

时间轴

2025-10-23

init

---

题目：

P226 翻转二叉树

https://leetcode.cn/problems/invert-binary-tree/description/?envType=study-plan-v2&envId=top-interview-150

先序遍历

#include <algorithm>
class Solution {
    public:
	TreeNode *invertTree(TreeNode *root)
	{
		if (root == nullptr) {
			return nullptr;
		}
		if (root->left == nullptr && root->right == nullptr) {
			return root;
		}
		std::swap(root->left, root->right);
		invertTree(root->left);
		invertTree(root->right);
		return root;
	}
};