微软等面试100题筛选答案-1-二元查找树转换成一个排序的双向链表

//输入一棵二元查找树，将该二元查找树转换成一个排序的双向链表。
//要求不能创建任何新的结点，只调整指针的指向。
#include <stdio.h>
#include "stdafx.h"
#include <iostream>
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
};

typedef BSTreeNode DoubleList;
DoubleList * pHead;
DoubleList * pListIndex;

void convertToDoubleList(BSTreeNode * pCurrent);
// 创建二元查找树
void addBSTreeNode(BSTreeNode * & pCurrent, int value){
    if (NULL == pCurrent){
        BSTreeNode * pBSTree = new BSTreeNode();
        pBSTree->m_pLeft = NULL;
        pBSTree->m_pRight = NULL;
        pBSTree->m_nValue = value;
        pCurrent = pBSTree;

    }
    else {
        if ((pCurrent->m_nValue) > value){
            addBSTreeNode(pCurrent->m_pLeft, value);
        }
        else if ((pCurrent->m_nValue) < value){
            addBSTreeNode(pCurrent->m_pRight, value);
        }
        else{
            //cout<<"重复加入节点"<<endl;
        }
    }
}

// 遍历二元查找树  中序
void ergodicBSTree(BSTreeNode * pCurrent){
    if (NULL == pCurrent){       
        return;
    }
    if (NULL != pCurrent->m_pLeft){
        ergodicBSTree(pCurrent->m_pLeft);   
    }

    // 节点接到链表尾部
    convertToDoubleList(pCurrent);
    // 右子树为空
    if (NULL != pCurrent->m_pRight){
        ergodicBSTree(pCurrent->m_pRight);
    }
}

// 二叉树转换成list
void  convertToDoubleList(BSTreeNode * pCurrent){

    pCurrent->m_pLeft = pListIndex;
    if (NULL != pListIndex){
        pListIndex->m_pRight = pCurrent;
    }
    else{
        pHead = pCurrent;
    }   
    pListIndex = pCurrent;
    cout<<pCurrent->m_nValue<<endl;
}

int main(){
    BSTreeNode * pRoot = NULL;
    pListIndex = NULL;
    pHead = NULL;
    addBSTreeNode(pRoot, 10);
    addBSTreeNode(pRoot, 4);
    addBSTreeNode(pRoot, 6);
    addBSTreeNode(pRoot, 8);
    addBSTreeNode(pRoot, 12);
    addBSTreeNode(pRoot, 14);
    addBSTreeNode(pRoot, 15);
    addBSTreeNode(pRoot, 16);
    ergodicBSTree(pRoot);
    return 0;
}
/
//4
//6
//8
//10
//12
//14
//15
//16

简洁版

#include "stdafx.h"
#include <iostream>
using namespace std;

class Node{
public:
	int data;
	Node *left;
	Node *right;
	Node(int d = 0, Node *lr = 0, Node *rr = 0):data(d), left(lr), right(rr){}
};

Node *create(){
	Node *root;
	Node *p4 = new Node(4);
	Node *p8 = new Node(8);
	Node *p6 = new Node(6, p4, p8);
 
	Node *p12 = new Node(12);
	Node *p16 = new Node(16);
	Node *p14 = new Node(14, p12, p16);
 
	Node *p10 = new Node(10, p6, p14);
	root = p10;
 
	return root;
}

Node *change(Node *p, bool asRight){
	if (!p)
		return NULL;
	Node *pLeft = change(p->left, false);
	if (pLeft)
		pLeft->right = p;
	p->left = pLeft;
 
	Node *pRight = change(p->right, true);
	if (pRight)
		pRight->left = p;
	p->right = pRight;
 
	Node *r = p;
	if (asRight){
		while (r->left)
		r = r->left;
	}else{
		while (r->right)
			r = r->right;
	}
	return r;
}

void main(){
	Node *root = create();
	Node *tail = change(root, false);
	while (tail){
		cout << tail->data << " ";
		tail = tail->left;
	}
	cout << endl;
 
	root = create();
	Node *head = change(root, true);
	while (head){
		cout << head->data << " ";
		head = head->right;
	}
	cout << endl;
}