把二元查找树转变成排序的双向链表——精选微软经典的算法面试100题中第一题

 

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

};

 

 

// TreeToDList.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <iostream> using namespace std; class Node //节点类 { friend class BSTree; friend void MiddlePrint(Node* root); public: Node(int ele = 0, Node *l = NULL, Node *r = NULL) :elememt(ele), left(l), right(r){} public: int elememt; Node *left; Node *right; }; class BSTree { public: BSTree(){ root = NULL; }; void InsertElement(int ele) //插入元素(非递归版本) { if (root == NULL) //根节点 root = new Node(ele); else { Node *current = root; // Node *result = NULL; //指向ele节点的父节点 while (current != NULL) { result = current; //先将current保存起来 if(ele < current->elememt) current = current->left; else current = current->right; } Node *node = new Node(ele); if(ele < result->elememt) result->left = node; else result->right = node; } } Node* GetRoot()const //获取根节点 { return root; } private: Node *root; }; //二叉搜索树的中序输出 void MiddlePrint(Node* root) { Node *temp = root; if(temp == NULL) return; MiddlePrint(temp->left); cout<<temp->elememt<<" "; MiddlePrint(temp->right); } /************************************************************************/ /* 函数功能：将二叉搜索树转换为双链表（和递归中序遍历一样） */ /************************************************************************/ typedef Node DoubleList; DoubleList *head = NULL; //链表的头节点 DoubleList *end = NULL; //链表的尾节点 DoubleList* ConverToDoubleList(Node *root) { Node *temp = root; if(temp == NULL) return NULL; ConverToDoubleList(temp->left); //递归转换左边 temp->left = end; //left指向前面节点 if (end == NULL) //当为空链表时 end = head = temp; else //非空 { end->right = temp; } end = temp; ConverToDoubleList(temp->right); //递归右边 return head; } //打印双链表 void PrintDoubleList(DoubleList *head) { while (head != NULL) { cout<<head->elememt<<" "; head = head->right; } } int _tmain(int argc, _TCHAR* argv[]) { BSTree tree; int arr[] = {10, 6, 14, 4, 8, 12, 16}; int size = sizeof(arr) / sizeof(int); for(int i = 0; i < size; i++) tree.InsertElement(arr[i]); cout<<"该二叉搜索树的中序输出为："<<endl; MiddlePrint(tree.GetRoot()); cout<<endl; DoubleList *head = ConverToDoubleList(tree.GetRoot()); PrintDoubleList(head); return 0; }