9-6-binary sorting tree-search-Chapter 9th-Data Structure textbook source code-yan Weimin Wu Weimin edition, 9-6-Data Structure
Textbook source code
Chapter 4 search-binary sorting 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 \ 06 BinarySortTree
Overview
Binary Sort Tree is also called Binary Search Tree.
Analysis
The binary sorting tree is either an empty tree or a binary tree of the following nature:
(1) If the left subtree is not empty, the value of all nodes on the left subtree is smaller than the value of its root node;
(2) If the right subtree is not empty, the value of all nodes on the right subtree is greater than the value of its root node;
(3) Left and Right decision trees are also Binary Decision Trees;
(4) There are no nodes with equal key values.
Source code File 1☛BinarySortTree. h
File 2☛BinarySortTree. c
File 3☛BinarySortTree-main.c (test documentation)
File 4☛TestData_Table.txt (query table test data)
Test Result Display
Updating more chapters...