previous
|
index
|
next
Binary Tree Properties
Q
: A full tree of height
h
has how many nodes?
A
:
2
h+1
-1
previous
|
index
|
next