9-10-double-chain tree-search-Chapter 9th-Data Structure textbook source code-yan Weimin Wu Weimin edition, 9-10-Data Structure

9-10-double-chain tree-search-Chapter 9th-Data Structure textbook source code-yan Weimin Wu Weimin edition, 9-10-Data Structure

Textbook source code

Chapter 2 search-double-link tree (Key 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☛Status. h, Scanf. c

Test data download link☛Data Packets

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

Overview

The double-stranded tree is one of the key tree storage methods (the other is the Trie tree), which is represented by the tree's child-brother linked list.

Analysis

Inserting or deleting a keyword in a double-link tree is equivalent to inserting or deleting a subtree on a node in the tree.

Source code File 1☛DLTree. h

File 2☛DLTree. c

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

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

Test Result Display

Updating more chapters...