To learn data structure well, we must first learn pointers in C language. The internal series connection of data mechanism depends entirely on the function of pointer. Pointers are difficult mainly because they are variables with addresses. In addition, the pointer concatenation of pointers leads to many misunderstandings. First of all, learn to understand, have a general understanding of the memory structure of the computer, and have a basic understanding of some common binary conversion and byte alignment.

Understand concepts and build abstract models, such as simple queue and FIFO mode. When designing a data model, you need to have a head-to-head and tail-to-tail concept. Data needs to be inserted from the tail to the head of the queue, and basically three attributes will be generated, namely head-to-head pointer, tail-to-tail pointer and structure value. Common methods include deleting and emptying queues, inserting queues, dequeuing queues and creating initial queues.

You need flexible practice, flexible code debugging, and the combination of data structures is infinitely changeable to write code. The secret of the algorithm is transformation, and so is the data structure. If you master the basic data organization algorithm, you can learn the next classic algorithm book "Introduction to Algorithms" on the premise of learning the data structure well. This is a classic algorithm book.

Learning data institutions should not think about any skills or methods, and adjust themselves to the best learning state, and the methods will naturally come. Don't set any restrictions on yourself. Setting the bottom line will only put you in a fence. Learning new things is a process of self-breakthrough. Don't put too much pressure on yourself when you start learning.