Name: Anonymous 2016-08-19 12:32
challenges tba by challengers!
1 on 1 battles!
1 on 1 battles!
void traverse(Node *e, void (*pre)(Node*,void*), void *prectx,
void (*post)(Node*,void*), void *postctx) {
Node *i = e;
goto child:
while(e->firstchild) {
e = e->firstchild;
child:
pre(e, prectx);
}
for(;;) {
post(e, postctx);
if(e->nextsib) {
e = e->nextsib;
goto childloop;
}
if(e == i || !e->parent)
return;
e = e->parent;
}
}