题目:输入一棵二元查找树,将该二元查找树转换成一个排序的双向链表。要求不能创建任
何新的结点,只调整指针的指向。
//二叉树结点结构
typedef struct Node
{
int data;
struct Node *Left;
struct Node *Right;
}ListNode;
//算法一
ListNode* ConvertNode(ListNode* pNode, bool asRight)
{
if (pNode == NULL)
{
return NULL;
}
ListNode* left=NULL;
ListNode* right=NULL;
if (pNode->Left)
{
left = ConvertNode(pNode->Left, false);
left->Right = NULL;
cout << endl << "左节点" << endl;
printLeftList(left);
cout << endl;
}
if (pNode->Right)
{
right = ConvertNode(pNode->Right, true);
right->Left = NULL;
cout<<endl<<"右节点" << endl;
printRightList(right);
cout << endl;
}
if (left)
{
pNode->Left = left;
left->Right = pNode;
}
if (right)
{
pNode->Right = right;
right->Left = pNode;
}
ListNode* pTemp = pNode;
if (asRight)
{
while (pTemp->Left != NULL)
{
pTemp = pTemp->Left;
}
}
else
{
while (pTemp->Right != NULL)
{
pTemp = pTemp->Right;
}
}
return pTemp;
}
//算法二
void ConvertNode(ListNode* pNode, ListNode*& pLastNodeInList)
{
if (pNode==NULL)
{
return;
}
else
{
if (pNode->Left)
{
ConvertNode(pNode->Left, pLastNodeInList);
}
pNode->Left = pLastNodeInList;
pLastNodeInList = pNode;
if (pNode->Right)
{
ConvertNode(pNode->Right, pLastNodeInList);
}
}
}