8 Comments
User's avatar
Shabnam's avatar

such a helpful article. put in simple language . thanks

Expand full comment
Hitesh Garg's avatar

What a fantastic article Vivek 👏

Just to add, we can also include that B+ tree has doubly linked list instead of singly linked list so that we can traverse in both direction of nodes from the matching node.

Expand full comment
Vivek Bansal's avatar

Thanks Hitesh for adding this. Actually, I am still in confusion if B+Tree has doubly linked list or singly linked list? Can you please add some resource so that I can refer the same.

Expand full comment
Hitesh Garg's avatar

Hi Vivek,

I had asked this question to ChatGPT after reading through your article since I was also confused that if it is not doubly linked list then how would we traverse the whole tree with the help of linked list.

However, I have managed to find below references where doubly linked list is mentioned, though I am unsure about their credibility:

https://studyglance.in/ds/display.php?tno=30&topic=B+-Tree

https://opendsa-server.cs.vt.edu/ODSA/Books/CS3/html/BTree.html

Expand full comment
Ganesh Busam's avatar

Clean and concise. Thanks.

Expand full comment
mzikpotato's avatar

Good read, can you write a blog on btree indexes vs hash indexes and what are the use cases ?

Expand full comment
Vivek Bansal's avatar

Sure will try to cover this in the future editions:)

Expand full comment
Sampath Kavala's avatar

A very helpful article with clear distinction between both B- trees and B+ trees with the help of distinct pointers. It really helped build my intuition. Thanks

Expand full comment