Practice16:
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
S1
牛客解题之一:
二叉搜索树,中序遍历由小到大,中间变量指向当前遍历节点的上一节点,并进行left、right指针指向
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
private:
TreeNode* midnode = NULL;
public:
void ConvertLoop(TreeNode* root)
{
if(!root)return;
ConvertLoop(root->left);
root->left = midnode;
if(midnode){
midnode->right = root;
}
midnode = root;
ConvertLoop(root->right);
}
TreeNode* Convert(TreeNode* pRootOfTree)
{
if(!pRootOfTree)return NULL;
ConvertLoop(pRootOfTree);
midnode = pRootOfTree;
while(midnode->left){
midnode = midnode->left;
}
return midnode;
}
};