(个人水平有限,请见谅!)
题目描述:
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
代码示例:
/*
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)
{
if (!pRootOfTree)
return NULL;
TreeNode* pre = NULL;
dfs(pRootOfTree, pre);
TreeNode* res = pRootOfTree;
while (res->left)
res = res->left;
return res;
}
void dfs(TreeNode* cur, TreeNode*& pre)
{
if (!cur)
return;
dfs(cur->left, pre);
cur->left = pre;
if (pre)
pre->right = cur;
pre = cur;
dfs(cur->right, pre);
}
};