二叉树与双向链表

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

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    TreeNode* prev = NULL;
    void _Convert(TreeNode* cur)
    {
        if(cur == NULL)
            return;
        //中序遍历
        _Convert(cur->left);
        cur->left = prev;
        if(prev)
            prev->right = cur;
        prev = cur;
        _Convert(cur->right);
        
    }
    TreeNode* Convert(TreeNode* pRootOfTree)
    {
         prev = NULL;
        _Convert(pRootOfTree);
        TreeNode* head = pRootOfTree;
        //遍历树找到双链表的头并返回链表的头
        while(head && head->left)
        {
            head = head->left;
        }
        return head;
    }
};