题目:
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
void ConvertNode(TreeNode* pRootOfTree, TreeNode **lastNodeInlist)
{
if (pRootOfTree == NULL)
return;
TreeNode* pCurrent = pRootOfTree;
if (pCurrent->left != NULL)
{
ConvertNode(pCurrent->left, lastNodeInlist);
}
pCurrent->left = *lastNodeInlist;
if (*lastNodeInlist != NULL)
{
(*lastNodeInlist)->right = pCurrent;
}
*lastNodeInlist = pCurrent;
if (pCurrent->right != NULL)
{
ConvertNode(pCurrent->right, lastNodeInlist);
}
}
TreeNode* Convert(TreeNode* pRootOfTree)
{
TreeNode* lastNodeInlist = NULL;
ConvertNode(pRootOfTree, &lastNodeInlist);
TreeNode* headNodeOfList = lastNodeInlist;
while (headNodeOfList && headNodeOfList->left)
headNodeOfList = headNodeOfList->left;
return headNodeOfList;
}
};