树 递归 数叶子 求深度

 

void Pre_Order_Traverse(BitTree T)
{if(T)
    {cout<<T->data;
     Pre_Order_Traverse(T->lchild);
     Pre_Order_Traverse(T->rchild);
     }
}
void In_Order_Traverse(BitTree T)
{if(T)
    {
     In_Order_Traverse(T->lchild);
     cout<<T->data;
     In_Order_Traverse(T->rchild);
}
}

 

void Leaf_Count(BitTree T)
{if(T)
 {if(!(T->lchild)&&!(T->rchild))
    n++;
Leaf_Count(T->lchild);
Leaf_Count(T->rchild);
}
}
int Leaf_Count2(BitTree T)//方法2
{int n,m;
if(!T)return 0;
 {if(!(T->lchild)&&!(T->rchild))return 1;
 else {m=Leaf_Count2(T->lchild);
       n=Leaf_Count2(T->rchild);
       return m+n;}
  }
}
int Leaf_Count3(BitTree T)//方法3
{int n,m,sum=0;
if(T)
{if(!(T->lchild)&&!(T->rchild))sum++;
       m=Leaf_Count2(T->lchild);
       n=Leaf_Count2(T->rchild);
       sum=m+n;
    }
 return sum;
}
int High_Tree(BitTree T)
{int h,h1,h2;
    if(!T)h=0;
    else
    {h1=High_Tree(T->lchild);
     h2=High_Tree(T->rchild);
     h=max(h1,h2)+1;
    }
    return h;
}