Tree Mirror output(二叉树翻转)

最新推荐文章于 2023-02-25 22:41:55 发布

无名_1989

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量224

点赞数

文章标签： Tree

本文链接：https://blog.csdn.net/dongyu_1989/article/details/79191326

版权

递归：

class Solution {
public:
    void Mirror(TreeNode* root) {
        if(!root) return ;
        swap(root);
        if(root->left)
          Mirror(root->left);
        if(root->right)
          Mirror(root->right);
    }
    
    void swap(TreeNode * root)
    {
        TreeNode * tmp = root->left ;
        root->left = root->right;
        root->right = tmp;
    }
};

非递归(层次遍历)：

class Solution {
public:
    void Mirror(TreeNode* root) {
        if(!root) return;
        deque<TreeNode *> dq;
        dq.push_back(root);
        while(!dq.empty())
        {
            TreeNode * node = dq.front();
            dq.pop_front();
            swap(node);
            if(node->right)
            {
                dq.push_back(node->right);
            }
            if(node->left)
            {
                dq.push_back(node->left);
            }
        }
    }
    
    void swap(TreeNode * root)
    {
        TreeNode * tmp = root->left ;
        root->left = root->right;
        root->right = tmp;
    }
};

非递归(先序遍历)：

class Solution {
public:
    void Mirror(TreeNode* root) {
        if(!root) return;
        stack<TreeNode *> dq;
        dq.push(root);
        while(!dq.empty())
        {
            TreeNode * node = dq.top();
            dq.pop();
            swap(node);
            if(node->right)
            {
                dq.push(node->right);
            }
            if(node->left)
            {
                dq.push(node->left);
            }
        }
    }
    
    void swap(TreeNode * root)
    {
        TreeNode * tmp = root->left ;
        root->left = root->right;
        root->right = tmp;
    }
};