二叉搜索树与双向链表

题目描述

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

思路：中序遍历二叉搜索树就得到升序序列，注意没说循环链表，不要将尾节点的right指向head。

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    bool first = true;
    TreeNode* head = NULL;
    TreeNode* last = NULL;
    void midOrder(TreeNode* p)
    {
        if(!p) return;
        midOrder(p->left);
        if(first)
        {
            head = p;
            last = p;
            first = false;
        }
        else
        {
            last->right = p;
            p->left = last;
            last = p;
        }
        midOrder(p->right);
    }
    TreeNode* Convert(TreeNode* pRootOfTree)
    {
        midOrder(pRootOfTree);
        //last->right = head;
        //head->left = last;
        return head;
    }
};