思路:一个节点的高度等于左子树和右子树高度中大的+1;
叶子节点即左右都为NULL
遍历到NULL 应该返回
int btDepth(TreeNode* root)
{
if(NULL==root)
return 0;
int lh = btDepth(root->left);
int rh = btDepth(root->right);
int height = lh>rh?lh+1:rh+1;
return height;
}
void leafNum(TreeNode* root,int* num)
{
if(NULL==root)
{
return;
}
if(root->left==NULL&&root->right==NULL)
{
(*num)++;
}
leafNum(root->left,num);
leafNum(root->right,num);
}