What is the time complexity of operations in a B-tree data structure?

The time complexity of operations in a B-tree data structure is O(log n), where n is the number of elements in the tree.