leetcode 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 aske

/**
 * 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 preTraverser(vector<TreeNode*> &preOrder, TreeNode *root) {
		if(root!=NULL) {
			preOrder.push_back(root);
			preTraverser(preOrder, root->left);
			preTraverser(preOrder, root->right);
		}
	}
	void flatten(TreeNode *root) {
		vector<TreeNode*> preOrder;
		preTraverser(preOrder, root);

		if(root==NULL) return;
		TreeNode *next = root;
		for(int i=1; i<preOrder.size(); i++) {
		    next->left=NULL;
			next->right = preOrder[i];
			next = next->right;
		}
	}
};