Describe the complexity (order) of deletion from a B-tree.
What will be an ideal response?
Like insertion, the complexity of deletion from a B-tree is logarithmic. That is, O(log n). Because the ripple effect of a deletion affects no more than one path from the root to a leaf, the complexity is equal to the height of the tree, which is log n for a tree of n nodes.
Computer Science & Information Technology
You might also like to view...
The process of recovering unused space in a database is known as ____________________ the database.
Fill in the blank(s) with the appropriate word(s).
Computer Science & Information Technology
Terminal Stream operation ________ performs processing on every element in a stream (e.g., display each element).
a. forNext b. for c. forAll d. forEach
Computer Science & Information Technology