2-5-single-chain table for merge chain storage-linear table-Chapter 2nd-source code of the data structure textbook-yan Weimin Wu Weimin edition, 2-5-Data Structure

2-5-single-chain table for merge chain storage-linear table-Chapter 2nd-source code of the data structure textbook-yan Weimin Wu Weimin edition, 2-5-Data Structure

Textbook source code

Chapter 2 linear table-merge a single-chain table (Chain Storage)

-- 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☛Singlydomainlist. c

Test data download link☛Data Packets

 

Source code and test data storage directory in the document: Data Structure \ ▲textbook Algorithm Implementation \ ▲02 linear table \ 05 MergeList

 

Overview
The merge of chained Single-Chain tables is consistent with the single-chain table algorithm stored in the merge sequence.

Analysis
Insert operations are involved when you merge a single-chain table. In a sequentially stored single-chain table, inserting an element means moving the element after the insertion point. However, in the chain storage single-chain table, you only need to change the pointer near the insertion point, saving a lot of time.

The method for inserting an element into a chain-store single-chain table is as follows:



Source code File 1☛MergeList. h


File 2☛MergeList. c


File 3☛MergeList-main.c (test documentation)


File 4☛TestData_HL.txt)

File 5☛TestData_TL.txt (tail plug-in data document)

Test Result Display
 

Updating more chapters...