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

9-8-B tree-search-Chapter 9th-Data Structure textbook source code-yan Weimin Wu Weimin edition, 9-8-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 \ 08 B-Tree

Overview

B-tree, B-tree, and B-tree are concepts, but they are written in different ways and can be read as B-tree. Note that no B-tree exists.

B is a balanced multi-path search tree, which is useful in files.

Analysis

Note that when talking about the order of the B-tree, it is based on the number of sub-trees that each node can accommodate. For example, for a B tree with a depth of 3 and a order of 3:

Relatively speaking, B-tree search is easier than deletion. Pay attention to the splitting and merging of nodes in different situations.

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...