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
Hints:
If you notice carefully in the flattened tree, each node's right child points to the next node of a pre-order traversal.
用栈实现的方法:
/**
* Definition for binary tree
* 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==NULL){
return;
}
TreeNode *head= new TreeNode(0),*cur=head;
stack<TreeNode *> s;
s.push(root);
while(!s.empty()){
TreeNode *tmp=s.top();
s.pop();
cur->right=tmp;
cur->left=NULL;
if(tmp->right){
s.push(tmp->right);
}
if(tmp->left){
s.push(tmp->left);
}
cur=cur->right;
}
delete head;
head=NULL;
}
};