求二叉树的深度和宽度[Java]

private static int getHeight(BiNode head) {

if(head==null)            //结束条件
return 0;
/*      else   if(head.left==null||head.right==null)
return 1;*/                                //这一句可要可不要
else return 1+Math.max(getHeight(head.left), getHeight(head.right));
}

private static int getWidth(BiNode head) {
if(head==null)
return 0;
int max=1;

LinkedList<BiNode>ll=new LinkedList<BiNode>();
ll.add(head);
while(true){
int len=ll.size();
if(len==0)
break;
while(len>0){
BiNode b=ll.poll();
len--;
if(b.left!=null)
ll.add(b.left);
if(b.right!=null)
ll.add(b.right);
}
max=Math.max(max, ll.size());

}
return max;
}