Скачать или смотреть How is the insert operation in a B-Tree O(log n), should it not be O( log 2d -1 ) where d is the de

Hello everyone! I hope this video has helped solve your questions and issues. This video is shared because a solution has been found for the question/problem. I create videos for questions that have solutions. If you have any other issues, feel free to reach out to me on Instagram:   / ky.emrah  

Below, you can find the text related to the question/problem. In the video, the question will be presented first, followed by the answers. If the video moves too fast, feel free to pause and review the answers. If you need more detailed information, you can find the necessary sources and links at the bottom of this description. I hope this video has been helpful, and even if it doesn't directly solve your problem, it will guide you to the source of the solution. I'd appreciate it if you like the video and subscribe to my channel!How is the insert operation in a B-Tree O(log n), should it not be O( log 2d -1 ) where d is the degree of the B-Tree

A search operation in B-Tree can be O(logn) because we can perform a binary search on the key we are looking for at any node. When inserting a key in a B-Tree node which isn't full and is the leaf node, we would need to scan all the elements of the node to make an insertion in the sorted order, so the worst case time complexity would be O(2d-1) where d = Degree of the B-Tree.
n
Example:
B-Tree degree = 3
Max Items = 2(3) - 1
If my B-Tree has just a root node which isn't full then inserting a value 98 in the below node will require me to shift all my keys one slot to the right to maintain the sort order, which means I would need to go through all my keys to insert the key at the right position making it O ( 2d - 1 ), where d = degree of B-Tree.
98
| 99 | 100 | 101 | 102 | NULL |

| 99 | 100 | 101 | 102 | NULL |

After insertion
| 98 | 99 | 100 | 101 | 102 |

| 98 | 99 | 100 | 101 | 102 |

I would like to understand how the insert operation has a time complexity of O ( log n ).


Tags: insert,b-treeSource of the question:
https://stackoverflow.com/questions/7...

Question and source license information:
https://meta.stackexchange.com/help/l...
https://stackoverflow.com/