example of insertion and deletion in B trees

Insertion of a Node in B-Tree happens at_________

B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are

In a B-tree, when splitting a node due to an insertion that exceeds its capacity, where does the middle key go?

In a B+ tree, both the internal nodes and the leaves have keys.