114. Flatten Binary Tree to Linked List

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

For example,
Given

         1
        / \
       2   5
      / \   \
     3   4   6

The flattened tree should look like:

   1
    \
     2
      \
       3
        \
         4
          \
           5
            \
             6

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 preorder(TreeNode* root,vector<TreeNode*>& temp)
    {
        if(root==NULL)
        return ;
        temp.push_back(root);
        preorder(root->left,temp);
        preorder(root->right,temp);
        return ;
    }
    void flatten(TreeNode* root) {
        TreeNode* top = new TreeNode(0);
        vector<TreeNode*> temp;
        preorder(root,temp);
        for(auto p:temp)
        {
            p->left=p->right=NULL;
            top->right=p;
            top=top->right;
        }
        return ;
    }
};