algorithm - How to do search in B+tree -


can explain how search done in b+ tree? confusing thing me in comparison b-tree, b+tree doesn't hold data in internal nodes, in leaves. examples have b+-tree index build on list of names. want find name "mary". root key in b+tree 20. how should compare "mary" 20, if 20 holds no data?


Comments

Popular posts from this blog

python - No exponential form of the z-axis in matplotlib-3D-plots -

excel vba - VBA Proxy auto-configuration for http requests -

php - phpWord - Tables with borders in headers/footers -