give me a b+ tree code which will take 80K data and it wll visualize the data on the page make a webiste like iclsing all the features of visulizarion u use next js with jsx
Loading...
make it more advances user can iput numbers and order bsed on tha it will hwo the viualizaton like this
Loading...
chek the website again it not doin gnaytng fix it use fix it use lcoalstoaeg if need but insert geenate iraodm cleat tee and rmeove notng workng the vislixatin sho be in tree fomatt like this [20]
/
[5, 12] [20, 30]B+ Tree Rules (Order 4)
Order 4 means:
Each internal node can have max 3 keys and max 4 children.
Each leaf node can have max 3 entries.
All leaves are at the same level.
Internal nodes have at least ceil(m/2) children (so at least 2 children here, except root).
Leaf nodes contain actual data keys and are linked for fast sequential access.
When nodes overflow (exceed max keys), they split:
Leaf node splits into two leaves; the first key of the right leaf is promoted to the parent.
Internal node splits into two internal nodes; middle key promoted up.
The root can have fewer than minimum keys but must have at least two children if not a leaf. its a exa[le so you unsestand i can be any order user can out the oder also . so ifx it all