微软算法题--采自July博客

1.把二元查找树转变成排序的双向链表
 题目：
输入一棵二元查找树，将该二元查找树转换成一个排序的双向链表。
要求不能创建任何新的结点，只调整指针的指向。
   
  10
  / /
 6 14
 / / / /
4 8 12 16
   
 转换成双向链表
4=6=8=10=12=14=16。
   
 首先我们定义的二元查找树 节点的数据结构如下：
 struct BSTreeNode
{
  int m_nValue; // value of node
  BSTreeNode *m_pLeft; // left child of node
  BSTreeNode *m_pRight; // right child of node
};

 

解法：对每个节点，左子树构成的链表在其左端，右子树构成的链表在其右端，所以，构造函数：

 

int get_list(BSTreeNode *&pNode, BSTreeNode *&pHead, BSTreeNode *&pTail)；

 

整体代码如下：

#include <iostream> #include <vector> #include <stdlib.h> #include <time.h> using namespace std; struct BSTreeNode { int m_nValue; // value of node BSTreeNode *m_pLeft; // left child of node BSTreeNode *m_pRight; // right child of node }; int get_list(BSTreeNode *&pNode, BSTreeNode *&pHead, BSTreeNode *&pTail) { BSTreeNode *pLhead = NULL, *pLtail = NULL; if(pNode->m_pRight != NULL) { get_list(pNode->m_pRight, pLhead, pTail); pLhead->m_pLeft = pNode; pNode->m_pRight = pLhead; }else pTail = pNode; if(pNode->m_pLeft != NULL) { get_list(pNode->m_pLeft, pHead, pLtail); pLtail->m_pRight = pNode; pNode->m_pLeft = pLtail; }else pHead = pNode; return 0; } int insert_BSTree(BSTreeNode *root, BSTreeNode *node) { if(node->m_nValue < root->m_nValue) { if(root->m_pLeft == NULL) root->m_pLeft = node; else return insert_BSTree(root->m_pLeft, node); } else{ if(root->m_pRight == NULL) root->m_pRight = node; else return insert_BSTree(root->m_pRight, node); } return 0; } int build_BSTree(BSTreeNode **root, vector<int> &vQ) { for(vector<int>::iterator it = vQ.begin(); it != vQ.end(); it++) { if(*root == NULL) { (*root) = new BSTreeNode; (*root)->m_nValue = *it; (*root)->m_pLeft = NULL; (*root)->m_pRight = NULL; }else{ BSTreeNode *nNode = new BSTreeNode; nNode->m_nValue = *it; nNode->m_pLeft = NULL; nNode->m_pRight = NULL; insert_BSTree(*root, nNode); } } return 0; } int print_tree(BSTreeNode *root) { if(root->m_pLeft != NULL) print_tree(root->m_pLeft); cout << root->m_nValue << endl; if(root->m_pRight != NULL) print_tree(root->m_pRight); return 0; } int main() { const int count = 10; int arr[count] = {12, 2, 45, 23, 66, 14, 89, 55, 34, 12}; vector<int> vQ; // srand(time(NULL)); for(size_t i=0; i<count; i++) { vQ.push_back(arr[i]);//rand()); cout << vQ[i] << endl; } cout << endl << endl; BSTreeNode *root = NULL; build_BSTree(&root, vQ); print_tree(root); cout << endl << endl; BSTreeNode *pHead = NULL, *pTail = NULL; get_list(root, pHead, pTail); for(root = pHead; root != NULL; root = root->m_pRight) cout << root->m_nValue << endl; cout << "Hello world!" << endl; return 0; }