This preview shows page 1. Sign up to view the full content.
Unformatted text preview: children. We know from Chapter 5 that the complete binary tree with k levels has at least 2 k − 1 leaves. The 2-3 tree of k levels will have the most nodes if every parent has three children. A 3-ary tree with k levels can have as many as 3 k − 1 nodes....
View Full Document
This note was uploaded on 12/27/2011 for the course MAP 2302 taught by Professor Bell,d during the Fall '08 term at UNF.
- Fall '08