leetcode刷题，总结，记录，备忘114

最新推荐文章于 2022-09-09 22:49:00 发布

guicaisa

最新推荐文章于 2022-09-09 22:49:00 发布

阅读量670

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/guicaisa/article/details/51089445

版权

leetcode 专栏收录该内容

128 篇文章 0 订阅

订阅专栏

本文记录了一道LeetCode上的题目，要求将给定的二叉树扁平化为单链表。解决方案是通过简单的先序遍历，将节点连接到其右子树上。

摘要由CSDN通过智能技术生成

leetcode114 Flatten Binary Tree to Linked List

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

The flattened tree should look like:

click to show hints.

Subscribe to see which companies asked this question

这个题目，很简单，，，简单的先序遍历二叉树，然后把节点全连在右子树上就行了。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void flatten(TreeNode* root) {
        if (root == NULL)
        {
            return;
        }
        
        stack<TreeNode *> st;
        st.push(root);
        vector<TreeNode *> vt;
        
        while (!st.empty())
        {
            TreeNode * t = st.top();
            st.pop();
            vt.push_back(t);
            
            if (t->right)
            {
               st.push(t->right); 
            }
            
            if (t->left)
            {
                st.push(t->left);
            }
        }
        
        for (int i = vt.size() - 1; i >= 0; --i)
        {
            if (i == vt.size() - 1)
            {
                vt[i]->right = NULL;
                vt[i]->left = NULL;
            }
            else
            {
                vt[i]->right = vt[i + 1];
                vt[i]->left = NULL;
            }
        }
    }
};