Does index use btree or b+tree?

For a long time I thought he was using btree until I saw this document link which says WiredTiger maintains a table’s data in memory using a data structure called a B-Tree (B+ Tree to be specific). But I found the source code of the btree link which doesn’t look like a b+tree(because I can’t find the next or pre pointer for leaf node). This make me confused. Can someone give me some pointers?

According to official manual, mongodb uses B+ tree.

I found it, but in source code, no evidence can be found that the leaf nodes are connected

https://groups.google.com/g/wiredtiger-users/c/1YHbNXPw-1A

This topic was automatically closed 5 days after the last reply. New replies are no longer allowed.