Files
freeCodeCamp/guide/english/algorithms
Harshit Omer c4f17674cf 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
2019-05-12 15:19:23 -07:00
..
2019-03-07 13:23:16 -08:00
2019-04-01 23:55:53 +05:30
2019-01-14 19:20:30 -06:00
2019-03-05 14:27:24 -08:00