Summary of the overall framework of the data structure

Data structure storage structure

Array (sequential storage) and linked list (chained storage)
As for the difference between arrays and linked lists, I have a detailed explanation in another article-Linked List Summary-Common Linked Lists, how to implement the LRU cache elimination algorithm, and how to write linked lists The code, since this article focuses on the overall framework, I won’t talk about it here. Interested students can go to my article to find the answer, and I will put the
link below: link: link .

Basic operation of data structure

Traversal plus access , to be more specific, it is to add, delete, check and modify . You can think about it, isn't the series of operations we are doing a series of these processing on the data structure?

How to traverse + visit?

The traversal of various data structures + access to the totality has two forms: linear and non-linear.
Linearity is represented by for/while iteration, and non-linearity is represented by recursion.