9-9-B + tree-search-Chapter 9th-Data Structure textbook source code-yan Weimin Wu Weimin edition, 9-9-B Data Structure

9-9-B + tree-search-Chapter 9th-Data Structure textbook source code-yan Weimin Wu Weimin edition, 9-9-B Data Structure

Textbook source code

Chapter 2 search-B + tree

-- Data Structure-yan Weimin. Wu Weimin

Source code instructions☛☛☛Data Structure-C language version (Yan Weimin, Wu Weimin version) Textbook source code + EXERCISE set parsing instructions

Textbook source code compilation Link☛☛☛Data Structure textbook source code compilation

Question set full resolution Link☛☛☛Analysis and compilation of data structure question set

 

File links introduced in this source code☛Base. c

Test data download link☛Data Packets

 

Source code and test data storage directory in the document: Data Structure \ ▲textbook Algorithm Implementation \ ▲09 lookup \ 09 B + Tree

 

Overview

B + tree and B + tree are the same thing. They can be read as B + tree.

The B + tree is a variant of B that is required by the File System (strictly speaking, it does not belong to the tree described in chapter 2 ).

Analysis

B + and B are similar in concept, but there are also differences:

(1) The node with n subtree contains n keywords.

(2) All leaf nodes contain all the keyword information and pointer to the records containing these keywords, and the leaf node itself links from small to large according to the size of the keyword.

(3) All non-terminal nodes can be regarded as index parts. The node only contains the maximum or minimum keywords in its subtree (root node.

Note: When searching in Tree B, a keyword may be matched at any non-leaf node and the search may end. However, in the B + tree, you must find the layer of the leaf node to stop.

Source code File 1☛B + Tree. h

 File 2☛B + Tree. c

File 3☛B + Tree-main.c (test documentation)

 

File 4☛TestData_Table.txt (query table test data)

 

Test Result Display

 

Updating more chapters...