C++中创建二叉树并计算节点数量的程序示例（直接运行，无需修改）

#include <iostream> 
#include<stdlib.h>

typedef struct Node{
	int data;
	Node* lchild;
	Node* rchild;
	
}btNode,* BTNode;


BTNode Create(){
	BTNode T=(BTNode)malloc(sizeof(btNode));
	T->data=1;
	T->lchild=(BTNode)malloc(sizeof(btNode));
	BTNode b1=T->lchild;
	b1->lchild=NULL;
	b1->data=2;
	b1->rchild=NULL;
	T->rchild=NULL;
	return T;
}

int func(BTNode T){
	if(T==NULL){
		return 0;
	}
	int n1,n2 ;
	n1=func(T->lchild);
	n2=func(T->rchild);
	return 1+n1+n2;
	
}



int main(int argc, char** argv) {
	BTNode T=Create();
	printf("%d",func(T));

	
	
	return 0;
}