JZTXT

二叉搜索树与双向链表

发布时间 2023-04-12 18:55:52作者: 穿过雾的阴霾
class Solution {
public:
    TreeNode* pre=NULL;
    void dfs(TreeNode* root)
    {
        if(!root)   return;
        dfs(root->left);
        root->left=pre;
        if(pre) pre->right=root;
        pre=root;
        dfs(root->right);
    }
    TreeNode* convert(TreeNode* root) {
        dfs(root);
        while(root&&root->left) root=root->left;
        return root;
    }
};