从顶部开始逐层打印二叉树结点数据
#include <stdlib.h>
struct TreeNode
{
struct TreeNode *l,*r;
int v;
};
struct Link
{
struct TreeNode *node;
struct Link *next;
};
void print2x(struct Link* p, struct Link* last)
{
struct TreeNode *n;
struct Link l,r;
if (p==0) return;
n=p->node;
printf("%d/n", n->v);
if (n->l){
l.node=n->l,l.next=NULL;
last->next=&l,last=&l;
}
if (n->r){
r.node=n->r, r.next=NULL;
last->next=&r, last=&r;
}
print2x(p->next, last);
};
int main()
{
struct TreeNode n[10];
struct Link l;
int i;
for (i = 0; i< 10; ++i)
n[i].v = i, n[i].l=n[i].r=NULL;
n[0].l=&n[1];
n[0].r=&n[2];
n[1].l=&n[3];
n[1].r=&n[4];
n[2].l=&n[5];
n[2].r=&n[6];
n[3].l=&n[7];
n[3].r=&n[8];
n[4].l=&n[9];
n[4].r=NULL;
l.next = NULL;
l.node = &n[0];
print2x(&l,&l);
}