70道常见面试算法笔试题.docx

微软等面试?100题答?案1.把二元查找?树转变成排?序的双向链?表题目：输入一棵二?元查找树，将该二元查?找树转换成?一个排序的?双向链表。要求不能创?建任何新的?结点，只调整指针?的指向。10/ /6 14/ / / /4 8 12 16转换成双向?链表4=6=8=10=12=14=16。首先我们定?义的二元查?找树节点的数据?结构如下：struc?t BSTre?eNode?{int m_nVa?lue; // value? of nodeBSTre?eNode? *m_pLe?ft; // left child? of nodeBSTre?eNode? *m_pRi?ght; // right? child? of node};//引用 245 楼 tree_?star 的回复#inclu?de stdio?.h#inclu?de iostr?eam.hstruc?t BSTre?eNode?{int m_nVa?lue; // value? of nodeBSTre?eNode? *m_pLe?ft; // left child? of nodeBSTre?eNode? *m_pRi?ght; // right? child? of node};typed?ef BSTre?eNode? Doubl?eList?;Doubl?eList? * pHead?;Doubl?eList? * pList?Index?;void conve?rtToD?ouble?List(BSTre?eNode? * pCurr?ent);// 创建二元查?找树void addBS?TreeN?ode(BSTre?eNode? * pCurr?ent, int value?){if (NULL == pCurr?ent){BSTre?eNode? * pBSTr?ee = new BSTre?eNode?();pBSTr?ee-m_pLe?ft = NULL;pBSTr?ee-m_pRi?ght = NULL;pBSTr?ee-m_nVa?lue = value?;pCurr?ent = pBSTr?ee;}else {if ((pCurr?ent-m_nVa?lue) value?){addBS?TreeN?ode(pCurr?ent-m_pLe?ft, value?);}else if ((pCurr?ent-m_nVa?lue) value?){addBS?TreeN?ode(pCurr?ent-m_pRi?ght, value?);}else{//cout重复加入节?点endl;}}}// 遍历二元查?找树中序void ergod?icBST?ree(BSTre?eNode? * pCurr?ent){if (NULL == pCurr?ent){ retur?n;}if (NULL != pCurr?ent-m_pLe?ft){ergod?icBST?ree(pCurr?ent-m_pLe?ft); }// 节点接到链?表尾部conve?rtToD?ouble?List(pCurr?ent);// 右子树为空?if (NULL != pCurr?ent-m_pRi?ght){ergod?icBST?ree(pCurr?ent-m_pRi?ght);}}// 二叉树转换?成list?void conve?rtToD?ouble?List(BSTre?eNode? * pCurr?ent){pCurr?ent-m_pLe?ft = pList?Index?;if (NULL != pList?Index?){pList?Index?-m_pRi?ght = pCurr?ent;}else{pHead? = pCurr?ent;} pList?Index? = pCurr?ent;coutpCurr?ent-m_nVa?lueendl;}int main(){BSTre?eNode? * pRoot? = NULL;pList?Index? = NULL;pHead? = NULL;addBS?TreeN?ode(pRoot?, 10);addBS?TreeN?ode(pRoot?, 4);addBS?TreeN?ode(pRoot?, 6);addBS?TreeN?ode(pRoot?, 8);addBS?TreeN?ode(pRoot?, 12);addBS?TreeN?ode(pRoot?, 14);addBS?TreeN?ode(pRoot?, 15);addBS?TreeN?ode(pRoot?, 16);ergod?icBST?ree(pRoot?);retur?n 0;}//////////////////////