HW4A - b. Show the result of deleting 0 and then 9 from the...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
p.141 4.23 Show the result of accessing the keys 3, 9, 1, 5 in order in the splay tree in Figure 4.61. Figure 4.61 10 11 7 9 5 6 8 4 12 1 2 13 3 Result for 3: 10 11 7 9 5 6 8 4 12 1 2 13 3 Result for 9: 5 7 6 10 11 9 8 4 12 1 2 13 3
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Result for 1: 5 7 6 10 11 9 8 4 12 1 2 13 3 Result for 5: 3 4 2 1 7 8 6 5 10 11 9 12 13
Background image of page 2
p.143 4.36 a. Show the result of inserting the following keys into an initially empty 2-3 tree: 3, 1, 4, 5, 9, 2, 6, 8, 7, 0.
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b. Show the result of deleting 0 and then 9 from the 2-3 tree created in part (a). a: 3, 1, 4 4 : - 4, 5, 9 3, 1, 2 6, 9, 8 4 : 6 4, 5 3, 1, 2 b: 3, 1, 2 4, 5 4 : - 6, 7 8, 9 8 : - 6 : - 2, 3 4, 5 2 : 4 6, 7 8, 9 8 : -6 : - 0, 1 6, 7, 8 4 : 6 4, 5 1, 2, 3...
View Full Document

This note was uploaded on 02/16/2011 for the course CS 136 taught by Professor Yuechen during the Winter '08 term at Zhejiang University.

Page1 / 3

HW4A - b. Show the result of deleting 0 and then 9 from the...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online