Describe the complexity (order) of insertion into a B-tree.
What will be an ideal response?
The power of a B-tree is in it's flatness. An insertion causes a ripple effect no more than the height of the tree. So the complexity of an insertion is O(log n).
Computer Science & Information Technology
You might also like to view...
Which of the following is a CSS named color?
a. maroon b. crimson c. lavender d. All of these
Computer Science & Information Technology
A Sway site organizes text, images, and video into a __________.
Fill in the blank(s) with the appropriate word(s).
Computer Science & Information Technology