leetcode226. Invert Binary Tree

https://leetcode.com/problems/invert-binary-tree/description/

TreeNode* invertTree(TreeNode* root) {
    if (root) {
        invertTree(root->left);
        invertTree(root->right);
        std::swap(root->left, root->right);
    }
    return root;
}

使用了迭代

图解如下:

猜你喜欢

转载自www.cnblogs.com/captain-dl/p/9657669.html