notes19b

In one row the medium key is promoted continue until

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the subtree  ­> continue search Complexity: lets say B ­Tree has n keys Height is: h = O(log d n ) All operations including search, insert, remove are O (log n) 5 Insertion  ­ Like 2 ­3 Trees  ­ Find the leaf where new key should be  if space available, insert key in leaf  if not, split & promote   Largest keys in one row   ­ Smallest keys in one row The medium key is promoted Continue until parent has room. (May have to split root) Examples： B ­Tree with degree: d=5, ! Each internal node has: | ! | = 2 (at least 2 keys) d  ­1 =4 (at most 4 keys) Operations: insert (17)/insert(6)...
View Full Document

This note was uploaded on 02/04/2014 for the course CS 234 taught by Professor Baranoski during the Spring '09 term at Waterloo.

Ask a homework question - tutors are online