2c03-review - 00071

2c03-review 00071 - 5 9 11 1 3 4 6 8 10 12 13 0 1 2 3 4 5 6 7 8 9 10 11 12 13 b[10 Merge the tree of Question(1a with the tree consisting of leaves

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

View Full Document Right Arrow Icon
14 16.[20] Suppose we use the 2-3 trees to implement the WMERGE (i.e. a MERGE(A,B), but the set is totally ordered and all the elements of A are smaller than the elements of B) and SPLIT. a.[10] Show the result of splitting the tree of Question (1a) at 7. 2
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 5 9 11 1 - 3 4 6 - 8 - 10 - 12 13 0 1 2 3 4 5 6 7 8 9 10 11 12 13 b.[10] Merge the tree of Question (1a) with the tree consisting of leaves for elements 14 and 15. 5 9 2 - 7 - 11 14 1 - 3 4 6 - 8 - 10 - 12 13 14 - 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15...
View Full Document

This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.

Ask a homework question - tutors are online