LeetCode 0114 - Flatten Binary Tree to Linked List

Flatten Binary Tree to Linked List

Desicription

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

For example, Given

代码语言：javascript复制

    1
   / 
  2   5
 /    
3   4   6

The flattened tree should look like:

代码语言：javascript复制

1
 
  2
   
    3
     
      4
       
        5
         
          6

Solution

代码语言：javascript复制

/**
 * 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 {
private:
    TreeNode* prev = NULL;
public:
    void flatten(TreeNode* root) {
        if(root == NULL)
            return ;
        flatten(root->right);
        flatten(root->left);
        root->right = prev;
        root->left = NULL;
        prev = root;
    }
};

binary flatten list tree

0 人点赞