algorithm - What's the insert complexity of btree? -
It seems that when a new node is inserted (whose complexity is O (logen)), the whole tree is re-balanced should be done .
What is the complexity of balance again?
This height is the tree. It does not get reborn in the meaning of binary tree when you add node, if it is due to division, then you put a key in the node above it if it causes division as part, then you only get one level up Do, etc., until you reach the root. So the complexity is (logen).
Comments
Post a Comment