previous
|
index
|
next
Properties of Binary Trees
h
leaves(h)
nodes(h)
0
1
1
1
2
3
2
4
7
3
8
15
.
.
.
.
.
.
.
.
.
h
2
h
2
h+1
-1
previous
|
index
|
next
