时间轴

2025-10-23

init

题目：

P226 翻转二叉树

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

先序遍历

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
#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;
	}
};

leetcode hot 100 rewrite

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */

struct TreeNode {
        int val;
        TreeNode *left;
        TreeNode *right;
        TreeNode()
                : val(0)
                , left(nullptr)
                , right(nullptr)
        {
        }
        TreeNode(int x)
                : val(x)
                , left(nullptr)
                , right(nullptr)
        {
        }
        TreeNode(int x, TreeNode *left, TreeNode *right)
                : val(x)
                , left(left)
                , right(right)
        {
        }
};

#include <algorithm>
class Solution {
    public:
        TreeNode *invertTree(TreeNode *root)
        {
                if (root == nullptr)
                        return nullptr;

                root->left = invertTree(root->left);
                root->right = invertTree(root->right);

                std::swap(root->left, root->right);

                return root;
        }
};