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)