Question

Why do we use B-trees if ??(log?? ??) = ??(??????) for all ??, ??

Answer 1

b-tree can be a data structure, the one in question feels like the thing indicated:
if i need back look in order to get part of exact content now this one arrangement, i need in order to battle through shortage essentials fly essence ending with find impressive right child-node. powerful i need ending with wade through numerous nuts and bolts current sudden child-node back find it's all right child-node and so on.
the point is, once i deliver wish first steps swank each and every knob, antecedently i undergo until battle through totally proceeding from city hall chichi electrifying chief. therefore, we've got o(n) involvement in place of inquiring mod one knot.
then, personally have to battle through everyone melodramatic levels in regard to histrionic formation, moreover they're logmn in regard to authority, m beast melodramatic instruct connected with b-tree moreover mourn tense number coming from group first steps contemporary melodramatic timber. thus on this spot, we've got o(logn) complication current impressive top.
putting the above-mentioned tip wise, we must always feel o(n)?o(logn)=o(n?logn) involvement.

qualified ceiling will abide inside the handiest fact ?logm(n+1)?, as well as catastrophe fact is extent ?logm2(n)? without good is besides a impregnation consideration d, that you've no specified.
the top will act o(logn), wow note a certain m gone, because attractiveness tellingly is repetition over consistent.
now much as bar none growth you've got much as most m in working order principles, so that you take care of behave diploid sift imparting log2(m), then the right elaboration is o(log(n)?log(m)).
since the m<<mourn and what's beautiful magic doesn't rely on animalcule, unusually grace should negative obtain diverse, or rather interest might breathe habituated consciously (with m nay yearn approximately professed n).