题目描述
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
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
void flatten(TreeNode* root) {
if (root == NULL) return;
TreeNode* rt = root;
TreeNode* right = rt->right;
rt->right = NULL;
if (rt->left) {
flatten(rt->left);
rt->right = rt->left;
rt->left = NULL;
}
while(rt->right) rt = rt->right;
if (right) {
flatten(right);
rt->right = right;
}
return;
}
};