Can you list the main operations implemented in B-trees?

The main operations implemented in B-trees include:

• Search: finding a key in the tree with logarithmic complexity.
• Insertion: adding a new key with subsequent rebalancing.
• Deletion: removing a key while maintaining B-tree properties.
• Traversal: visiting all keys in sorted order (e.g., in-order).

B-trees are used for efficient storage and retrieval of data on disks and in databases, minimizing external memory accesses.