题目描述
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
代码
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
TreeNode* pre = NULL;
TreeNode* lastLeft = NULL;
TreeNode* Convert(TreeNode* pRootOfTree)
{
if(NULL == pRootOfTree)
{
return NULL;
}
Convert(pRootOfTree->left);
pRootOfTree->left = pre;
if(NULL != pre)
{
pre->right = pRootOfTree;
}
pre = pRootOfTree;
lastLeft = lastLeft == NULL ? pRootOfTree:lastLeft;
Convert(pRootOfTree->right);
return lastLeft;
}
};
运行结果
运行时间:4ms
占用内存:476k
解题思路