计算二叉树的高度的递归和非递归实现

1.递归方法

int FindTreeDeep(BinTree BT){
      int deep=0;
      if(BT){
         int lchilddeep=FindTreeDeep(BT->lchild);
         int rchilddeep=FindTreeDeep(BT->rchild);
         deep=lchilddeep>=rchilddeep?lchilddeep+1:rchilddeep+1;
      }
     return deep;
}int FindTreeDeep(BinTree BT){