tree - BTree Complexity based on M and L and based on order of insertion and deletion -


what big oh btree depends on m = number of keys , l = number of leaves?

how btree deal deleting in order , in reverse order?

i doing analysis on how m , l , way things inserted , deleted in btree determines runtime.

b-trees remain balanced @ times, deleting in reverse order same deleting in-order, , start @ same level (the deepest level).

depending on b-tree implementation, operations occur in o(log(m) * log(l)) time or o(m * log(l)) time. latter known small m values, because binary searching inside array of 5 or elements not worth it.


Comments

Popular posts from this blog

jquery - How can I dynamically add a browser tab? -

node.js - Getting the socket id,user id pair of a logged in user(s) -

keyboard - C++ GetAsyncKeyState alternative -