最近出去的一次笔试中,考到了二叉树的相关算法,虽然工作两年多了,现场居然忘了怎么写。回来后仔细想了想,把这个算法写了出来,仔细分析了下在考场没写出算法的原因:没有考虑到二叉树的节点自身的顺序信息。
代码如下
#include "stdafx.h"
#include "iostream.h"
struct Node
{
int nNum;
Node *pLeft;
Node *pRight;
};
Node *CreateBinTree(int arData[],int i,int nLen);
void TreePreeOut(Node *pNode);
int main(int argc, char* argv[])
{
int arData[7] = {1,2,3,4,5,6,7};
Node *pNode = CreateBinTree(arData,0,7);
TreePreeOut(pNode);
return 0;
}
//创建二叉树
Node *CreateBinTree(int arData[],int i,int nLen)
{
if (i > nLen - 1)
return NULL;
Node *pTopNode = new Node;
pTopNode->nNum = arData[i];
pTopNode->pLeft = CreateBinTree(arData,2 * i + 1,nLen);
pTopNode->pRight = CreateBinTree(arData,2 * i + 2,nLen);
return pTopNode;
}
//输出二叉树
void TreePreeOut(Node *pNode)
{
if (pNode == NULL)
return;
int nIndex = pNode->nNum;
TreePreeOut(pNode->pLeft);
cout << pNode->nNum << endl;
TreePreeOut(pNode->pRight);
}
输出是中序输出,可以通过修改得到前序和后序输出