[1]把二元查找树转变成排序的双向链表

【题目】输入一棵二元查找树，将该二元查找树转换成一个排序的双向链表。要求不能创建任何新的结点，只调整指针的指向。

10

//

6       14

//       //

4   8   12   16

转换成双向链表

4=6=8=10=12=14=16 。

【思路】

按照二叉树的中序正好按顺序遍历全部节点，在遍历的过程中，更改它的逻辑结构。

【答案】

// Exereise.cpp #include "stdafx.h" #include <iostream> using namespace std; struct BSTreeNode { int m_nValue; // value of node BSTreeNode *m_pLeft; //leftchild ofnode BSTreeNode *m_pRight; // right child ofnode }; typedef BSTreeNode DoubleList; DoubleList *pHead = NULL; DoubleList *pDoubleList = NULL; // 创建二元查找树 void addBSTreeNode(BSTreeNode *& pCurrent, int value) { if(NULL == pCurrent) { BSTreeNode * pTree = new BSTreeNode(); pTree->m_pLeft = NULL; pTree->m_pRight = NULL; pTree->m_nValue = value; pCurrent = pTree; } else { if(value > pCurrent->m_nValue) { addBSTreeNode(pCurrent->m_pRight,value); } else if(value < pCurrent->m_nValue) { addBSTreeNode(pCurrent->m_pLeft,value); } else { cout<<"Input invalid,there already have the value!"<<endl; } } } // 二叉树转换成list void convertToDoubleList(BSTreeNode * pCurrent) { pCurrent->m_pLeft = pDoubleList; if (NULL == pDoubleList) { pHead = pCurrent; } else { pDoubleList->m_pRight =pCurrent; } pDoubleList = pCurrent; } // 遍历二元查找树 中序遍历根节点 void ergodicBSTree(BSTreeNode * pCurrent) { if(NULL == pCurrent) return; else { if(NULL != pCurrent->m_pLeft) ergodicBSTree(pCurrent->m_pLeft); convertToDoubleList(pCurrent); if(NULL != pCurrent->m_pRight) ergodicBSTree(pCurrent->m_pRight); } } int _tmain(int argc, _TCHAR* argv[]) { int value; BSTreeNode *pBSTree = NULL; cin>>value; while(-1 != value) { addBSTreeNode(pBSTree,value); cin>>value; } ergodicBSTree(pBSTree); while(pHead) { cout<<pHead->m_nValue<<endl; pHead = pHead->m_pRight; } return 0; }