efanzh / introduction-to-algorithms

Implementations of algorithms and solutions to exercises and problems from the book Introduction to Algorithms, Third Edition.

EFanZh

• Working on: Introduction to Algorithms, LeetCode, MIT 6.S081.
• Plan to work on: Category Theory for Programmers, Essentials of Compilation, Essentials of Programming Languages, MIT 6.824, Physically Based Rendering, Programming Languages and Lambda Calculi, Software Foundations, The Book of Shaders, The Little Typer, miniKanren.
• Tags: Arch Linux, Offensive programming, Rust.

introduction-to-algorithms's Issues

Why search for B+ tree is faster than B tree?

I am wondering why search for B+ tree is faster than B tree, and find that nearly no resources on the network talked about that.
I think that because B+ tree internal nodes does not need to save data pointers, so it can save more keys than B tree, and the height of B+ tree can be smaller than B tree, which makes the search process faster. But when the order of B tree is equal to B+ tree, I think the search time complexity of B tree and B+ tree is equal, so it can not be faster. Am I right? Thank you!
Besides, there is an answer talking about cache hit rate for B tree and B+ tree which I am not fully understand, is this the key for reducing searching time?