在栈顶指针为top的链栈中,编写一个计算该链栈中结点个数的函数.jinji

Question

如题所述

Answer 1

可以这样想：设栈的结构体，给出push的编法，经过push，如果要计算结点个数，
struct
stack
{

int
data;

stack
*down;
};
stack
*top
=
new
stack;
top->down
=
NULL;
void
push(
int
n,stack
*top
)
{

stack
*p
=
new
stack;

p->data
=
n;

p->down
=
top;

top
=
p;
}
int
lenth(
stack
*top
)
{

stacp
*p
=
top;

int
t
=
0;

while
(
p->down->down
)

{

t++;

p
=
p->down;

}

return
t;
}