From data structure-Description in C language, edited by Ning zhengyuan, China Water Conservancy and hydropower press, Shanghai Jiao Tong University Press, and Southeast University Press
Data
Data Element
Data item
Data Structure
Logical Structure
Data Type
Pointer pointer
Sequential Storage Structure
Linked Storage Structure
Dense index dense Index
Sparse index sparse Index
ABSTRACT Data Type abstract datatype
Algorithm
Correctness correctness
Readability readability
Robustness robustness
Frequency frequency count
Time Complexity time complexity
Space complexity space complexity
Direct precursor immediate predecessor
Directly follow immediate successor
Linear table linear list
Sequence Table sequenatial list
Singly linked list
Circular linked list circylar linked lists
Double linked lists
Double Circular linked list
Stack
Top Stack
Bottom-stack botton
Last in first out
Overflow
Underflow
Shared
Queue
Team end rear
Frontend front
First in last out
String
Substring
Pattern match pattern matching
Array Arrays
Row Major Order
Column is in the main order column Major Order
Special Matrix Special Matrices
Sparse Matrices
Triple table list of 3_tuples
Cross Linked List orthogonal list
Generalized table generalized lists
Tree
Binary Tree
Full Binary Tree
Complete Binary Tree
Binary sort tree
Binary Search Tree
Preorder traverse
Traverse inorder traversal in the middle order
Traverse postorder traversal in descending order
Huffman tree
Backtrack backtrackins
Graph
Directed Graph (digraph)
Undirected graph (undigraph)
Directed full graph undirected Complete Graph
Undirected full graph directed complete graph
Sparse Graph
Dense Graph
Outlet Network
Adjacent node adjacent
Degree
Outdegree
Indegree
Connected Graph
Connected branch connected component
Strong Graph
Generation tree Spanning Tree
Adjacency lists
Adjacency lists
Adjacency multilists
Depth-first search
Breadth-first search
Minimum Spanning Tree
Shortest Path
Directed Acyclic Graph
Topology Sorting Topological Sort
Search searching
Key
Primary Key
Sequential search
Binary Search
Block search
Balanced binary tree best wishes, alanced Binary Tree
Balance factor balanced factor
Direct address immediately allocate
Except the remainder division method
Digital Analysis Method
Folding Method
Linear probing
The square is the mid-square method of China and France.
Open addressing
Chaining
Sort sorting
Insert sort directly straight insertion sort
Shells Method
Reduce incremental sorting by diminishing increment sort
Semi-insert sorting binary insertion sort
2_way insertion sort
Shared insertion sorting shared insertion sort
Bubble sort
Quick Sort
Select sort selection sort
Sort straight selection sort directly
Tree Selection and sorting tree selection sort
Tournament sorting tournament sort
Heap Sort
Merge and sort merging sort
2_way merge
Multi_way merge
Base sorting Radix sorting
Ranking first (LSD) least significant digit first
Highest priority (MSD) most significant digit first
File files
Sequential File
Index file indexed file
Index sequential access method indexed sequential access method
Virtual Storage Access Method
Hash File
Multi-Keyword file with more than one key
Multilist File
Inverted File: Inverted File