1
vote
The relationship between a perfect binary tree and a complete & full binary tree
Here is the relevant text on that book, sixth edition.
Perfect Binary Trees
A perfect binary tree is one that is both full and complete. All leaf nodes will be at the same level, and this level has ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
trees × 787algorithms × 307
graphs × 236
data-structures × 210
binary-trees × 121
search-trees × 49
graph-traversal × 45
search-algorithms × 30
optimization × 26
time-complexity × 24
combinatorics × 24
recursion × 24
terminology × 23
balanced-search-trees × 22
algorithm-analysis × 21
dynamic-programming × 21
minimum-spanning-tree × 19
complexity-theory × 18
heaps × 18
binary-search-trees × 17
shortest-path × 16
spanning-trees × 15
discrete-mathematics × 14
reference-request × 10
strings × 10