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
Accepted
211,897
Submissions
523,663
/**
* 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:
vector<int> rel;
void flattentolist(TreeNode* root) {
if(root==NULL)
return;
rel.push_back(root->val);
flatten(root->left);
flatten(root->right);
}
void flatten(TreeNode* root){
flattentolist(root);
for(int i=0;i<rel.size();i++){
if(root!=NULL){
root->left=NULL;
root->val=rel[i];
if(i!=rel.size()-1){
TreeNode *rchild= new TreeNode(0);
root->right=rchild;
root=rchild;
}
}
}
}
};