public int nodeNum(Node head) {
if(head==null)
return 0;
return bs(head, 1, mostLeftLevel(head, 1));//第三个参数表示总深度
}
public static int bs(Node head,int level,int h) {
if(level==h)
return 1;
if(mostLeftLevel(head.right, level+1)==h)//右子树的最左节点与左子树的相同时
return (1<<h-level)+bs(head.right, level+1, h);//(1<<h-level)表示左子树加上根的总节点数,
else
return (1<<h-level-1)+bs(head.left, level+1, h);
}
public static int mostLeftLevel(Node head,int level) {
if(head!=null) {
level++;
head=head.left;
}
return level-1;//-1是因为传进来的节点判断非空时马上就加了1,所以现在才要减一
}
时间复杂度:(logN)^2