Register

B+ Tree

• edited by
533 views
2 2 votes
Implement the B+ Tree for the following data. 26, 27, 28, 3, 4, 7, 9, 46, 48, 51, 2, 6, where number of pointers that fit in one node are 3

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Regular Expression f...Next → · Dijkstra Algorithm
← Previous in category · Two-phase locking & ...Next in category → · go class test
Position:
Show:

No related questions found