题目描述
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。
/*
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 == NULL)
return pRootOfTree;
//排序
TreeNode* node = ConvertNode(pRootOfTree,0);
//返回最左的结点
while(node->left!=NULL)
node = node->left;
return node;
}
//递归
TreeNode* ConvertNode(TreeNode* node, int flag)
{
if(node == NULL)
return NULL;
TreeNode* left = ConvertNode(node->left,1);
TreeNode* right = ConvertNode(node->right,2);
node->left = left;
node->right = right;
//改变子树的指针方向,指向父亲
if(left != NULL)
node->left->right = node;
if(right != NULL)
node->right->left = node;
if(flag == 1)//左子树
{
if(right != NULL)
{
return right;
}
else
return node;
}
else if(flag == 2)//右子树
{
if(left != NULL)
return left;
else
return node;
}
else
return node;
}
};