二叉搜索树与双向链表

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

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    TreeNode* Convert(TreeNode* pRootOfTree)
    {
        if(!pRootOfTree)
            return NULL;
        return ConvertTree(pRootOfTree, true);
    }
    
    TreeNode* ConvertTree(TreeNode * root, bool isRight){
        if(!root)
            return NULL;
        TreeNode * left = ConvertTree(root->left, false);
        TreeNode * right = ConvertTree(root->right, true);
        root->left = left;
        if(left)
            left->right = root;
        root->right = right;
        if(right)
            right->left = root;
        if(isRight){
            while(root->left)
                root = root->left;
        }else{
            while(root->right)
                root = root->right;
        }
        return root;
    }
};