#Leetcode# 114. Flatten Binary Tree to Linked List

发布时间：2020-12-14 04:26:35 所属栏目：大数据来源：网络整理

导读：https://leetcode.com/problems/flatten-binary-tree-to-linked-list/ ? Given a binary tree,flatten it to a linked list in-place. For example,given the following tree: 1 / 2 5 / 3 4 6 The flattened tree should look like: 1 2 3 4 5 6 代码： /

https://leetcode.com/problems/flatten-binary-tree-to-linked-list/

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

For example,given the following tree:

    1
   /   2   5
 /    3   4   6

The flattened tree should look like:

代码：

/**
 * 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) return;
        flatten(root -> left);
        flatten(root -> right);
        
        TreeNode* R = root -> right;
        root -> right = root -> left;
        root -> left = NULL;
        TreeNode* cur = root;
        while(cur -> right) cur = cur -> right;
        cur -> right = R;
    }
};

　　好像一个世纪那么久没写 LC 了??

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!