The first introduction to Data Structures

The first introduction to Data Structures

Based on previous experience, I found that reading a book, if I read a book a day or a day, I read a little at the end, so these days I decided to take a shot and read the book "Introduction to Data Structure.

I seldom read such a thick book like this. If I had to watch it for more than half a month in a row before, I just don't know how it works, after all, these days are tough. Everyone knows that reading is difficult! So when you can't sleep, prepare a book in front of your bed. In this way, you will see that some books have left a lot of marks.

After reading this book, I first learned a little about it before. I remember the title of this chapter if I didn't understand it or have never touched it before, nothing else can chew on your mind. Secondly, I don't know if there is a problem with the way I look at it, or because it should be the first time. Many things need to be echoed many times in my mind, and then turn 9 to 18 turns, then, the stream goes up, the cut goes on, and it's still messy. Finally, I can understand it. In this case, I just finish reading the text and read it quickly. In order to improve efficiency, I will also try it.

After reading it, I first thought of drawing a map, then I opened the directory, thought about painting and modification, and got the figure:

The so-called data structure is actually the structure of data storage. Each data is regarded as an element and there is a different relationship between them, these regular storage methods are organized to facilitate data access and other operations. Therefore, this book focuses on the storage structure. After the storage structure is clarified, the rest is the operations on these elements, such as searching, sorting, inserting, and updating.

In the storage structure, the linear structure is relatively simple, followed by the tree structure, and then the graph structure is becoming more and more complex. These complex storage structures also read their corresponding search methods.

 

Introduction to Data Structure

1.
2. B
3.
4.
5. B
6. C
7.
8. D
9.2 (I-1)
10.
11. C
12. D
13.
14. C
15. C
16log2n
17. n-I + 1
18O (1)
19 team tails
20n-i + 1
21 42
22 14
23 leaves
24 (N of 2)-1
25 Connected Graph

26. Adjacent matrix
27 hash
28o (N square)

Question: What is the difference between the textbooks used in and those used in 12 years?

I have learned both of these books. the introduction to the data structure of the self-test is described in C language and requires the foundation of the Advanced Programming Language (1) of the corresponding course, that is, C .. if you have a better mathematical foundation, you can work hard without it.