统计二叉树节点个数

版权声明：转载请注明出处 https://blog.csdn.net/doubleguy/article/details/86571631

#include<bits/stdc++.h>
using namespace std;
typedef struct BiTNode{
	char data;
	struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;

void createBiTree(BiTree &t){
	char c;
	cin>>c;
	if(c=='#')
		t = NULL;
	else{
		t = new BiTNode;
		t->data = c;
		createBiTree(t->lchild);
		createBiTree(t->rchild);
	}
}

int NodeCount(BiTree t){
	if(t==NULL)
		return 0;
	else
		return NodeCount(t->lchild) + NodeCount(t->rchild) + 1;
}
int main(){
	BiTree t;
	createBiTree(t);
	cout<<"此二叉树节点个数为："<<NodeCount(t)<<endl;
	return 0;
}