#include<iostream>
#include<stack>
#define N 7
using namespace std;
typedef struct node
{
struct node *leftChild;
struct node *rightChild;
int data;
}BiTreeNode, *BiTree;
// 生成一个结点
BiTreeNode *createNode(int i)
{
BiTreeNode * q = new BiTreeNode;
q->leftChild = NULL;
q->rightChild = NULL;
q->data = i;
return q;
}
BiTree createBiTree()
{
BiTreeNode *p[N];
int i;
for(i = 0; i < N; i++)
p[i] = createNode(i + 1);
// 把结点连接成树
for(i = 0; i < N/2; i++)
{
p[i]->leftChild = p[i * 2 + 1];
p[i]->rightChild = p[i * 2 + 2];
}
return p[0];
}
void preOrderTraverse(BiTree T)
{
if(NULL == T)
return;
BiTreeNode *p = T;
stack<BiTreeNode *> s;
s.push(T);
while(!s.empty())
{
// 根进根出
p = s.top();
cout << p->data << " ";
s.pop();
// 根的右孩子被压入栈
if(NULL != p->rightChild)
s.push(p->rightChild);
//根的左孩子被压入栈
if(NULL != p->leftChild)
s.push(p->leftChild);
} // end while(!s.empty())
cout << endl;
}
int main()
{
BiTree T = createBiTree();
cout << "先序遍历:" << endl;
preOrderTraverse(T);
return 0;
}