if (node == NULLT)
return 0;
else {
- return 1+ iterfcns(tree,tree->NextSibling(node)) + iterfcns(tree,tree->FirstChild(node));
+ int tmp = iterfcns(tree,tree->FirstElement(node));
+ tmp += iterfcns(tree,tree->NextElement(node));
+ return tmp+1;
};
}