算法中与二叉树有关的题目，其实就是遍历+特殊操作

题目描述

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

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    TreeNode* head = NULL;
    TreeNode* pre = NULL;
    int is_root = 1;
    TreeNode* Convert(TreeNode* pRootOfTree)
    {
        if (pRootOfTree == NULL)
            return NULL;
        Convert(pRootOfTree->left);
        if (is_root)
        {
            is_root = 0;
            head = pRootOfTree;
        }
        pRootOfTree->left = pre;
        if (pre != NULL)
            pre->right = pRootOfTree;
        pre = pRootOfTree;
        Convert(pRootOfTree->right);
        return head;
    }
};