next up previous
Up: CSE 2320: Algorithms and Previous: Case 3b

Analysis

Delete

Disk Accesses: O(h), where h = O($\log_t n$)
Run Time: O(th)

B-Tree Operations

Disk Accesses: O(h) = O($\log_t n$) = O(lg n)
Run Time: O(th) = O(t $\log_t n$) = O(lg n)



Copyright © 1998 The University of Texas at Arlington