题目:
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)return;
flatten(root->left);
flatten(root->right);
TreeNode *p=root;
if(p->left==NULL)return;
else p=p->left;
while(p->right!=NULL)p=p->right;
p->right=root->right;
root->right=root->left;
root->left=NULL;
}
};