【牛客】二叉搜索树与双向链表

输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
        TreeNode* tmp = NULL;
        TreeNode* res = NULL;
    TreeNode* Convert(TreeNode* pRootOfTree)
    {
        ConvertSub(pRootOfTree);
        return res;
    }
    //二叉搜索树的中序遍历就是一个递增序列
    void ConvertSub(TreeNode* pRootOfTree){
        if(pRootOfTree==NULL) return;
        ConvertSub(pRootOfTree->left);
        if(tmp==NULL){
            tmp = pRootOfTree;
            res = pRootOfTree;
        }else{
            tmp->right = pRootOfTree;
            pRootOfTree->left = tmp;
            tmp = pRootOfTree;
        }
        ConvertSub(pRootOfTree->right);
    }
};