Data Str & Algorithm HW Solutions 65

Data Str & Algorithm HW Solutions 65 - children. We...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
65 4 2936 5 7183 6 9279 7 1111 8 7186 9 7739 (b) sec primary Next key index index key DEER 0 0 2398 1 DUCK 4 1 3456 2 FROG 7 2 8133 3 GOAT 9 3 9737 -1 4 2936 5 5 7183 6 6 9279 -1 7 1111 8 8 7186 -1 9 7739 -1 10.6 ISAM is space ef f cient, more so than the B-tree. If few records are inserted, the ISAM system will work well. ISAM will continue to work well even if a number of records are deleted. 10.7 The 2-3 tree of k levels will have the fewest nodes if no parent has three
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online