Skip to content
Coding FodingcodingFoding(you: Human)
  • Careers
  • Pricing

Theme

Heading font

  1. Home
  2. Database Internals
  3. Indexing
  4. B+Tree: Insert, Split and Merge

Part 03 · Indexing

B+Tree: Insert, Split and Merge

InsertPage splitMergeFill factor

What happens when a leaf is full: page splits, how they climb up the tree, merges on delete, and why random UUID keys split pages far more than serial ids.

⏱ 6 min · Station 17 of 123

161718
← Previous stopB+Tree: Structure and SearchNext stop →Hash Indexes
Coding FodingcodingFoding(you: Human)

Everything you need, in one path.

Start free

Learn

  • Backend First Principles
  • DevOps & Cloud
  • System Design
  • AI & LLM Engineering
  • Database Internals
  • Frontend System DesignSoon

Practice

  • DSA problems
  • AI / ML problemsSoon
  • System Design Problems
  • Build to Hire

Interview

  • Interview PrepSoon
  • Most Common QuestionsSoon
  • Interview ExperiencesSoon
  • Success StoriesSoon

Community

  • Leaderboard
  • Blogs
  • Roadmap

More

  • Careers
  • Pricing

//codingFoding()

© 2026 Coding Foding · Made with ❤️ in Bangladesh

v1.0.0