C++ 二叉树 叶子节点

include

include

include

using namespace std;
int sum=0;
int pos=0;
struct node
{
char info;
node*R;
node*L;
};
class tree
{
public:
node* Root;
string str;
node*create()
{

  char ch;
  ch=str[pos++];
  node*T;
  if(ch=='0')
      T=NULL;
  else
  {
      T=new node;
      T->info=ch;
      T->L=create();
      T->R=create();
  }
  return T;

}
void preorder(node*t)
{
node*T;
T=t;
if(T){
cout<info;
preorder(T->L);
preorder(T->R);
}
}
int count(node*T)
{
// cout<<”HELLO”<