题目
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
代码
class Solution {
public:
void flatten(TreeNode *root) {
if(root == NULL)
return;
while(root) {
if(root->left) {
TreeNode *t = root->left;
while(t->right)
t = t->right;
t->right = root->right;
root->right = root->left;
root->left = NULL;
}
root = root->right;
}
}
};