剑指offer（C++）--二叉搜索树与双向链表

二叉搜索树与双向链表

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

/*
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)
    {
         stack<TreeNode*> st;
        TreeNode *cur = pRootOfTree;
        TreeNode *pre = pRootOfTree;
        TreeNode *head = pRootOfTree;
        bool isFirst = true;
        while(cur||!st.empty())
        {
            while(cur)
            {
                st.push(cur);
                cur = cur->left;
            }
            cur = st.top();
            st.pop();
            if(isFirst)
            {
                head = pre = cur;
                isFirst = false;
            }
            else
            {
                pre->right = cur;
                cur->left = pre;
                pre = cur;
            }
            cur = cur->right;
        }
        return head;

    }
};