简体繁体中英

What to do if a B+ tree key has too few outgoing pointers?

原文 2015-12-01 03:11:37 8 1 c++/ data-structures/ b-tree

I try to do this problem but stuck on the step where the key 100 has 2 outgoing pointers. With what I learn in class, for it to valid for this given problem, at least 3 outgoing pointer and 1 leaf node. I'm stuck please help me.

There is an image on the top of the post, the problem is in there

1 answers

The root node is allowed to violate the B-tree condition. Otherwise you could never have a B-tree with < N/2 elements.

B+ tree insertion and searching

B+ Tree node implementation

Implementing an in memory storage with B+ tree index

C program to C++ B+ Tree

B+ tree with variable length keys

B+ Tree data structure for keys

Pointers in B Tree

B+ tree where keys are the sum of its children

Implementation of B/B+ Tree in relation to making a class a friend of another class dilemma

How should I approach the task of visualizing a B+ tree in C++?

暂无

The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.

Related Question B+ tree insertion and searching B+ Tree node implementation Implementing an in memory storage with B+ tree index C program to C++ B+ Tree B+ tree with variable length keys B+ Tree data structure for keys Pointers in B Tree B+ tree where keys are the sum of its children Implementation of B/B+ Tree in relation to making a class a friend of another class dilemma How should I approach the task of visualizing a B+ tree in C++?

Related Tags

What to do if a B+ tree key has too few outgoing pointers?

Question

1 answers

solution1 0 ACCPTED 2015-12-01 03:43:11

solution1
0 ACCPTED 2015-12-01 03:43:11