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.
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.
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:
such a helpful article. put in simple language . thanks
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.
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.
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
Clean and concise. Thanks.
Good read, can you write a blog on btree indexes vs hash indexes and what are the use cases ?
Sure will try to cover this in the future editions:)