二叉数的初始化和前序、中序、后序、层次遍历。

思路：
①先按照层次遍历的思想初始化树，其中保留初始化数组边界内的空结点，权值为0，结果为完全二叉树。
②建完树之后，通过递归遍历，剪取权值为0的枝，使之成为普通二叉树。

其中，初始化的数组中，必须包含空结点，值为0。

代码：
先建BTree.h头文件

#pragma once
#define ELEMTYPE int
typedef struct Node{
	ELEMTYPE data;
	Node *lchild;
	Node *rchild;
}*BTree,Node;
void InitTree(BTree HEAD,ELEMTYPE *a,int length);//初始化树，length为数组长度
void PreOrder(BTree Tree);//先序
void InOrder(BTree Tree);//中序
void LevelOrder(BTree Tree);//层次
void PostOrder(BTree Tree);//后续
void DelectNull (BTree Tree);//剪枝

再建compute.cpp文件

#include "BTree.h"
#include<vector>
#include<queue>
#include<iostream>
using namespace std;
void InitTree(BTree HEAD, ELEMTYPE * a, int length)
{
	queue<Node*>Q;
	Q.push(HEAD);
	for (int i = 0; i < length; i++)
	{
		//初始化该节点，若左右结点未越界，入队该节点的左右结点（包括空结点），出队该节点
			Q.front()->data = a[i];//初始化
			if (i * 2 + 1 < length)//左子树未越界
			{
					Node *node1 = new Node;
					Q.front()->lchild = node1;
				Q.push(Q.front()->lchild);
			}
			else//左子树越界
			{
				Q.front()->lchild = NULL;
			}
			if (i * 2 + 2 < length)//右子树未越界
			{
					Node *node2 = new Node;
					Q.front()->rchild = node2;
				Q.push(Q.front()->rchild);
			}
			else//右子树越界
			{
				Q.front()->rchild = NULL;
			}
			Q.pop();
		}
	DelectNull(HEAD);//剪枝
}

void PreOrder(BTree Tree)
{
	if (Tree == NULL)
		return;
	cout << Tree->data << endl;//访问
	if (Tree->lchild != NULL)
		PreOrder(Tree->lchild);
	if (Tree->rchild != NULL)
		PreOrder(Tree->rchild);
}
void InOrder(BTree Tree)
{
	if (Tree == NULL)
		return;

	if (Tree->lchild != NULL)
		InOrder(Tree->lchild);
	cout << Tree->data << endl;//访问
	if (Tree->rchild != NULL)
		InOrder(Tree->rchild);
}
void PostOrder(BTree Tree)
{
	if (Tree == NULL)
		return;

	if (Tree->lchild != NULL)
		PostOrder(Tree->lchild);

	if (Tree->rchild != NULL)
		PostOrder(Tree->rchild);
	cout << Tree->data << endl;//访问
}
void DelectNull(BTree Tree)
{
	if (Tree == NULL)
		return;

	if (Tree->lchild!=NULL&&Tree->lchild->data == 0)//左孩子权为0，则剪枝
		Tree->lchild = NULL;
	else
		DelectNull(Tree->lchild);

	if (Tree->rchild != NULL&&Tree->rchild->data == 0)//右孩子权为0，则剪枝
		Tree->rchild = NULL;
	else
		DelectNull(Tree->rchild);
}

void LevelOrder(BTree Tree)
{
	if (Tree == NULL)
		return;
	queue<BTree>Q;
	Q.push(Tree);//入队根节点
	
	while (!Q.empty())//遍历队列
	{
		if (Q.front() != NULL)
			cout << Q.front()->data << endl;//访问当前结点
		if (Q.front()->lchild != NULL)
			Q.push(Q.front()->lchild);//左孩子入队
		if (Q.front()->rchild != NULL)
			Q.push(Q.front()->rchild);//右孩子入队
		Q.pop();//出队当前结点
	}
}

测试：

#include"Btree.h"
#include<iostream>
using namespace std;
int main() {
	int a[7] = {1,0,3,0,0,4,5};//初始化数组
	BTree Head=new Node;
	InitTree( Head,a,7);
	cout << "层次遍历：" << endl;
	LevelOrder(Head);
	cout << "先序遍历：" << endl;
	PreOrder(Head);
	cout << "中序遍历：" << endl;
	InOrder(Head);
	cout << "后续遍历：" << endl;
	PostOrder(Head);
	getchar();
	return 0;
}