给你二叉树的根结点 root ,请你将它展开为一个单链表:
展开后的单链表应该同样使用 TreeNode ,其中 right 子指针指向链表中下一个结点,而左子指针始终为 null 。
展开后的单链表应该与二叉树 先序遍历 顺序相同。
/**
* 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) {
while(root){
//如果没有左子树
if(root->left==NULL){
root = root->right;
}
else{
TreeNode * node = root;
root = root->left;
//左子树的最右节点
while(root->right!=NULL){
root = root->right;
}
root->right = node->right;
node->right = node->left;
node->left = NULL;
root = node->right;
}
}
}
};
TreeNode * pre = NULL;
void flatten(TreeNode* root) {
if(root){
flatten(root->right);
flatten(root->left);
root->right = pre;
root->left = NULL;
pre = root;
}
}