Question

编写非递归算法，求二叉树中叶子结点的个数

Answer 1

typedef struct _btree {
int v;
struct _btree* l;
struct _btree* r;
} *node;

// . . . .

int count_nodes(node root)
{
node a[100];
node* p = a;
node t;
int n = 0;
*p++ = root;
while(p != a) {
t = *--p;
++n;
if(t->l) *p++ = t->l;
if(t->r) *p++ = t->r;
}
return n;
}