给定一个二叉树,原地将它展开为链表。
例如,给定二叉树
1 / \ 2 5 / \ \ 3 4 6
将其展开为:
1 \ 2 \ 3 \ 4 \ 5 \ 6
AC:
/**
* 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:
void flatten(TreeNode* root) {
if (root==NULL) return;
TreeNode* p;
p = root->left;
if(root->right)
{
while(p && p->right)
{
p = p->right;
}
if(p!=NULL) p->right = root->right;
}
if(root->left)
{
root->right = root->left;
root->left = NULL;
}
flatten(root->left);
flatten(root->right);
return;
}
};
AC了,超开心哒!