B+ tree insertion of Order4 | Data Structure | Bangla Tutorial

In this video i have discussed how to insert data in B+tree with order 4 in data structure.
Follow me on Facebook: / farhan.0784
Follow me on Linkedin: / md-farhan-hossan
you may contact via mail/skype/whatsapp:
mail: [e-mail]
skype: join.skype.com...
whatsapp: [phone]

[@mahiakter8944]

Thank you, sir.

[@md.shahadathossen5738]

Thanks!

[@Mahamudul_Hasan0]

Vai eta to bhul hoise..n=4 hole key 3 thikase..but minimum value to thaka lagbe minimum 2 ta..apni ek side e 1 ta arek side e 3 ta disen jeta B+ tree property break kore

[@rakibulislamrasel2684]

minimum nuumber of value (n/2)-1 that is 1

[@rakibulislamrasel2684]

Prerequisite: Introduction of B+ trees
In this article, we will discuss that how to insert a node in B+ Tree. During insertion following properties of B+ Tree must be followed:
Each node except root can have a maximum of M children and at least ceil(M/2) children.
Each node can contain a maximum of M - 1 keys and a minimum of ceil(M/2) - 1 keys.
The root has at least two children and atleast one search key.
While insertion overflow of the node occurs when it contains more than M - 1 search key values.
Here M is the order of B+ tree.

[@nazmulislamananto]

The usual rule says to split the leaf nodes so that the first ceiling(n/2) nodes are in the original node and others are in the new node. Then move the lowest search key from the newly created node to its parent. You did something different here, may be you could write the rules you followed in the description? Thank you.
[ By usual I meant rules from 'Database System Concepts 7th Edition' ( en.wikipedia.org/wiki/Database_System_Concepts ) ]