2023年数据结构心得体会.docx

《2023年数据结构心得体会.docx》由会员分享，可在线阅读，更多相关《2023年数据结构心得体会.docx（5页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、2023年数据结构心得体会 Experience The data structure design subject, it needs to change the theory to the computer debugging.At the beginning of the first leon of the subject, Mr.Lu explained the importance of it for us.It has some difficulty for us.It is a basic subject of other programming languages.Many s

2、tudents say that the data structure is not good to learn, I deeply understand this.When I first started learning, there were a lot of places I didnt understand.Every time I was in cla, the teacher gave us different design questions.It was a big challenge for us as a beginner.I remember walking throu

3、gh the contents of two trees in a cla, preorder, preorder, and preorder.Teacher Lu said, the content of this leon is very important.No matter whether you have understood it or not, listen carefully now.To tell the truth, I didnt really understand what I had done before, but I listened to the teacher

4、 carefully.Preorder traversal is very simple, is the three traversal, the simplest.And in order to traverse, listen to a little fuzzy, after the order traversal, also half understand, half understand, I thought, if the teacher once again, I certainly can understand.Later, the teacher drew a two tree

5、, smoked the students to the blackboard sorting, this two fork tree seems complex, but with first order traversal to row, not difficult.So I lined up in the following, first order, first order traversal, very simple, I am a little complacent, the teacher to the location of the point, I went up the r

6、ow in the order, go up after a row in a me.Then the teacher spoke again, I just understand, Lu teacher and aured us that the two tree is hard, the order and post order are not good, want to learn that we sort, and ask the students to row out respectively, the teacher also had my name, call me up in

7、order to distinguish the two row row which students answer correctly, I did not hesitate to answer.Because of this content, the first traversal of the two fork tree, the sequence traversal two fork tree, after the order traversal two fork tree, I really understand, for the first time on this cla so

8、succeful sense.Gradually interested in the course.I thought I would never understand the leon.Now I see, and if I listen carefully and try my best, this leon is not difficult.The degree of difficulty of data structure learning depends largely on personal interest.Its painful to make a task as a task

9、, and it will be fun to do it.Also hope that the teacher can see my change, in this also thank the teachers hard teaching.The teacher did not give up on me, several times my name go up, the teacher must see my progre.Later, I listened carefully every cla, although the teacher did not call the roll,

10、but I still listened very seriously.The parents expre the children and the children and the brothers.I can understand them very well.I listen to the lectures almost every cla.Sometimes I also take claes in my spare time to read what Ive been doing before.So, when I first read the textbooks, I memori

11、ze the concepts in mind, and then build a knowledge framework.The data structure includes linear structure, tree structure, graph structure or network structure.Linear structure including linear list, stack, queue, string, array, generalized list, stack and queue is a linear scale is limited, the da

12、ta object constraint string for character set, and an array of generalized list of linear table: data element in the table is a data structure.In addition to linear tables, the stack is the focus, because the stack is closely related to recursion, and recursion is an important tool in programming.Iv

13、e learned that Stack is a special linear list that can only be inserted and deleted at one end.It stores data in accordance with the principle of first in, first out.The incoming data is pushed to the bottom of the stack, and the last data pops up from the top of the stack at the top of the stack wh

14、en it is neceary to read data; A special linear table that allows only deleting operations at the front of the table (front) and inserting operations at the back of the table (rear).The inserted operation end is called the queue tail, and the deleted operation end is called the header.When there is

15、no element in the queue, it is called an empty queue.The list is a discontinuous and non sequential storage structure on the physical storage unit, and the logical order of the data elements is achieved by the order of pointer linking in the linked list.A linked list consists of a series of nodes th

16、at can be dynamically generated at run time.Each node consists of two parts: one is the data domain that stores the data elements, and the other is the pointer domain that stores the addre of the next node.Think oneself enter oneself for an examination of the profeional, but also the data structure

17、of this gate, this semester is over, more or le have gained some knowledge.Although the study is not very thorough, I believe that this will help a lot of self exams, so even if I finish the subject, I will not give up learning it. 数据结构心得体会 数据结构心得体会 数据结构心得体会（材料） 数据结构综合实验心得体会 数据结构实训心得体会 数据结构课程设计心得体会 数据结构课程设计心得体会 数据结构课程设计报告心得体会 数据结构 课程设计 心得体会（优秀） 数据结构试验心得