Timeline for Splitting a node in B+ tree with odd number of keys
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 5, 2019 at 21:12 | vote | accept | Vamsidhar | ||
| Dec 3, 2019 at 0:17 | comment | added | Vamsidhar | Thanks. My doubt was explicitly when the siblings are full and it needs to split. I haven't found any material to support the claim that split A is better than split B. It made me wonder because almost every implementation and visualization goes with split A. | |
| Dec 3, 2019 at 0:07 | history | answered | Pseudonym♦ | CC BY-SA 4.0 |