二叉搜索树与双向链表

来源：互联网发布：淘宝运营在家上班编辑：程序博客网时间：2024/06/05 04:57

问题描述：

输入一棵二叉搜索树，将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点，只能调整树中结点指针的指向。

算法代码：

struct BinaryTreeNode{int m_nValue;BinaryTreeNode* m_pLeft;BinaryTreeNode* m_pRight;}BinaryTreeNode* Convert(BinaryTreeNode* pRootOfTree){BinaryTreeNode *pLastNodeInList = NULL;ConvertNode(pRootOfTree, &pLastNodeInList);//pLastNodeInList指向双向链表的尾结点//需要我们返回头结点BinaryTreeNode *pHeadOfList = pLastNodeInList;while(pHeadOfList != NULL && pHeadOfList->m_pLeft != NULL)pHeadOfList = pHeadOfList->m_pLeft}//pLastNodeInList:表示已经整理好的双链表void ConvertNode(BinaryTreeNode* pNode, BinaryTreeNode** pLastNodeInList){if(pNode == NULL)return;BinaryTreeNode *pCurrent = pNode;if(pCurrent->m_pLeft != NULL)ConvertNode(pCurrent->m_pLeft, pLastNodeInList);//把链表中最后一个结点的根节点链接到链表中pCurrent->m_pLeft = *pLastNodeInList;if(*pLastNodeInList != NULL)(*pLastNodeInList)->m_pRight = pCurrent;*pLastNodeInList = pCurrent;if(pCurrent->m_pLeft != NULL)ConvertNode(pCurrent->m_pRight, pLastNodeInList);}

0 0