lc.226 翻转二叉树

![[Pasted image 20241124154400.png

300]]

TreeNode* invertTree(TreeNode* root) {
        if (root == NULL) return root;
        swap(root->left, root->right);  // 中
        invertTree(root->left);         // 左
        invertTree(root->right);        // 右
        return root;
    }

![[f276aedd3a1dabf10d664030cb22583.png

300]]