Basic learning framework of data structure, learning map

data structure

Directory structure of the map
Data structure and algorithm
Basic concepts & terminology
Data & data elements & data items & data objects
Logical structure & storage structure Logical structure
Linear structure linear table
General linear table linear table
Special linear table stack and queue
String
linear table promotion array
generalized table
nonlinear tree structure
tree
binary tree
illustrating a configuration
directed graph
to FIG no
storage structure
sequential storage structure
storage structure & data type abstract data types
algorithm & algorithm analysis algorithm is limited to a predetermined solve certain problems Long sequence of operations
Algorithm characteristics
Poorness
Determinism
Feasibility
Effective input
Algorithm output
Evaluate the pros and cons of the algorithm
Correctness
Readability
Robustness
High efficiency
Algorithm efficiency analysis
Algorithm time complexity
Algorithm space complexity Linear structure
Linear table sequence representation
Sequence table: Both logical and physical order are adjacent.
Chained representation.
Single-linked list.
Double-linked list.
Circular linked list.
Comparison of sequence table lists and
spatial dimension comparison
the time dimension comparison
list and sequence table T interview questions
to promote the linear form of
an array
of Generalized Stack Stack table definition & characteristics
after first-out
stack common operation represents &
sequentially & chain Stack Stack
into Stack & Pop
Stack and Recursion
Stack Application Queue Definition & Characteristics
of
Queue First In First Out Queue Representation & Common Operations
Circular Queue & Chain Queue
Dequeue &
Enqueue The concept of application string of queue
String structure
Sequence storage
chain type Storage
String Matching Algorithm
BF Algorithm
KMP Algorithm Nonlinear Structure
Tree Tree Basic Concepts
Binary Tree
Properties & Storage Structure
Binary Tree Traversal
Linear Binary
Tree Binary Tree Establishment
Huffman Tree
Basic Concepts
Construction Algorithm
Huffman Coding
AVL Tree
B-Tree Graph Concept
Storage Structure
Adjacency Table
Adjacency Matrix
Cross Linked List
Adjacent Multiple Table
Edge Set Array
Traversal
Depth-first traversal
Breadth-first traversal
Application
Minimum spanning tree
Shortest path
Topological sorting
Critical path advanced data structure
Top-down stretch tree
Red-black tree insertion
Rotation during insertion is often tested
Delete deterministic jump table
AA tree
treap tree
kd tree
Paired heap
algorithm
Search concept
Linear table search
Sequence search
Binary search
Block search
Tree search
Binary tree search
AVL tree search
B-tree
B+ tree
Hash search
Concept
Conflict resolution sort concept
Bubble sort
Selective sort
Insertion sort
Hill sort
Heap sort
Merge sort
Quick sort
base Sorting
Bucket sorting Sorting of
large data structures
External sorting (non-memory sorting) Graph theory algorithm
Greedy algorithm
Divide and conquer algorithm
Dynamic programming
Randomization algorithm
Backtracking algorithm

Guess you like

Origin blog.csdn.net/weixin_44763047/article/details/105918618