题解 | #二叉搜索树与双向链表#

static struct TreeNode* q=NULL;
void order(struct TreeNode* p){
    if(p->left)
        order(p->left);
    p->left=q;
    if(q)
        q->right=p;
    q=p;
    if(p->right)
        order(p->right);
}
struct TreeNode* Convert(struct TreeNode* pRootOfTree ) {
    // write code here
    if(!pRootOfTree) 
        return NULL;
    order(pRootOfTree);
    while(pRootOfTree->left) 
        pRootOfTree=pRootOfTree->left;
    return pRootOfTree;
}

class Solution {
public:
    vector<TreeNode*> tree;
    vector<TreeNode*> order(TreeNode* p){
        if(p->left)
            order(p->left);
        tree.push_back(p);
        if(p->right)
            order(p->right);
        return tree;
    }
    TreeNode* Convert(TreeNode* pRootOfTree) {
        if(!pRootOfTree)
            return NULL;
        order(pRootOfTree);
        for(int i=0;i<tree.size()-1;i++){
            tree[i]->right=tree[i+1];
            tree[i+1]->left=tree[i];
        }
        return tree[0];
    }
};