题目内容
（请给出正确答案）
[主观题]
统计某二叉链表存储的二叉树中的叶子结点个数，以下代码正确的是（）。
A、int leaf=0; void LeafCount(BiTree bt) { if(bt==NULL) return; if(bt-＞L==NULL && bt-＞R==NULL) leaf++; LeafCount(bt-＞L); LeafCount(bt-＞R); }
B、int leaf=0; void LeafCount(BiTree bt) { if(bt==NULL) return; LeafCount(bt-＞L); if(bt-＞L==NULL && bt-＞R==NULL) leaf++; LeafCount(bt-＞R); }
C、int leaf=0; void LeafCount(BiTree bt) { if(bt==NULL) return; LeafCount(bt-＞L); LeafCount(bt-＞R); if(bt-＞L==NULL && bt-＞R==NULL) leaf++; }
D、int leaf=0; void LeafCount(BiTree bt) { if(bt-＞L==NULL && bt-＞R==NULL) leaf++; LeafCount(bt-＞L); LeafCount(bt-＞R); }
提问人：网友xiaomayi0037
发布时间：2022-01-07
如搜索结果不匹配，请 
