Adding Time Analysis for B-Trees (#31013)
Adding Time Analysis for B-Trees (#31013)

* Adding Time Analysis for B-Trees

Time Analysis for B-Tree:

Suppose a B-tree has n elements and M is the maximum number of children a node can have. What is the maximum depth the tree could have? What is the minimum depth the tree could have?

    The worst-case depth (maximum depth) of a B-tree is: logM/2 n.
    The best-case depth (minimum depth) of a B-tree is: logM n.

Worst-Case Times for B-Trees:

    Adding or removing an element in a B-tree with n elements is O(log n).

* fix: removed duplicate info

jonathanihm/freeCodeCamp,FreeCodeCamp/FreeCodeCamp,BhaveshSGupta/FreeCodeCamp,BhaveshSGupta/FreeCodeCamp,BhaveshSGupta/FreeCodeCamp,jonathanihm/freeCodeCamp,raisedadead/FreeCodeCamp,FreeCodeCamp/FreeCodeCamp,raisedadead/FreeCodeCamp