int IntervallTree_bed::nonodes(Leaf * p) { int count = 0; if (p != NULL) { nonodes(p->left); nonodes(p->right); count++; } return count; }
int bstree::nonodes(nodeptr p) { int count=0; if (p!=NULL) { nonodes(p->left); nonodes(p->right); count++; } return count; }