int k;int count(bintnode * t) { if (!t) { return 0; } if (t) { k = count(t->lchild); k = k + count(t->rchild); if (t->lchild&&t->lchild) { k++; return k; } }}这样对吗