【正文】 s issue of a state tree, teaching programming issues such as a peak, known as a data element. Sometimes, a data from a number of data elements (Data Item), for example, the student information management system students each data element table is a student record. It includes students of the school, name, sex, nationality, date of birth, performance data items. These data items can be divided into two types : one called early such as student gender, origin, etc., these data were no longer divided in data processing, the smallest units。參考文獻(xiàn)[1] 余明興、 c++ builder 5實例精解[M].清華大學(xué)出版社，[2] ++ builder程序員學(xué)習(xí)數(shù)據(jù)結(jié)構(gòu)[M].人民郵電出版社，2003[3] ++ builder編程技巧、經(jīng)驗與實例[M].人民郵電出版社，[4] 葛一楠、李智慧、++ builder篇[M].國防工業(yè)出版社，[5] 嚴(yán)蔚敏、(C語言版) [M].清華大學(xué)出版社，[6] [M].中國水利水電出版社，[7] 徐孝凱. C++語言基礎(chǔ)教程[M].清華大學(xué)出版社，[8] 吳逸賢、 c++ builder 6程序設(shè)計[M].科技出版社，[9] ++ builder程序設(shè)計教程[M].冶金工業(yè)出版社，[10] 郭文夷、 c++ builder [M].西安電子科技大學(xué)出版社，[11]Horowitz E、Sahni S. Fundamentals of Data Structures. Pitmen Publishing Limites，1976[12]Gotlied C C、Gotlied L R. Data Types and Structures. PrenticeHall Inc.，1978附錄附錄A 外文翻譯－原文部分Computer programming data structure is an important theoretical basis for the design, it is not only the core curriculum of puter disciplines, and has bee a popular elective course other Polytechnic professional, so studied this course well and studied puter are closely related.一、the concept of data structureComputer data structure is the foundation of science and technology professional classes, is the essential core curriculum. All puter system software and application software to use various types of data structures. Therefore, if we want to make better use of puters to solve practical problems, only to several puter programming languages are difficult to cope with the many plex issues. To the effective use of puters, give full play to puter performance, but also must learn and master relevant knowledge of data structure. A solid foundation of data structure for learning other puter professional courses, such as operating systems, translation theory, database management systems, software engineering, artificial intelligence, etc. are very useful.二、why should learn from data structure？In the early development of puters, the use of puter designed primarily to deal with terms. When we use the puter to solve a specific problem, the following general needs through several steps : the first is a specific problem of appropriate abstract mathematical models, and then design or choose a mathematical model of the algorithm,the final procedures for debugging, testing, until they have the ultimate answer. Since then the object is INTEGER, REAL, BOOLEAN, the procedures of the main designers of energy is focused on programming skills, without attention to the data structure. With the expansion of puter applications and development of software and hardware, the issue of nonterms increasing importance. According to statistics, Now dealing with the issue of nonoccupancy of more than 90% of the machine time. Such issues involve more plex data structure, the relationships between data elements generally can not be described by mathematical formula. Therefore, the key to solving such problems is no longer mathematical analysis and calculations, but to devise appropriate data structure, can effectively address the problem. Description of the terms of such nonmathematical model is not a mathematical equation, but such as tables, trees, such as map data structure. Therefore, it can be said that data structure courses primarily designed to study the issue of nonvalue calculation procedures as a puter operations and the relationship between objects and their operating disciplines. The purpose of the study is to understand the structure of data for puter processing of the identity object to the practical problems involved in dealing with that subject at the puter out and deal with them. At the same time, through training algorithms to improve the thinking ability of students through procedures designed to promote student skills integrated applications and professional qualities.三、the concepts and terminologySystematic study of knowledge in the data structure before some of the basic concepts and terminology to give a precise meaning. Data (Data) is the information carrier, it could be puter identification, storage and processing. It is the puter processing of raw materials, a variety of data processing applications. Computer science, puter processing is the socalled data objects, which can be numerical data can be non numerical data. Numerical data are integer, the actual number or plural, mainly for engineering puting, scientific puting and mercial processing。所以在有些地方肯定存在了許多的不足之處。通過四個月的畢業(yè)設(shè)計，一個數(shù)據(jù)結(jié)構(gòu)算法演示系統(tǒng)可以說是大體完成了。同時我還要感謝所有老師，正是因為他們的辛勤教導(dǎo)，才有我們今天的成果。而她在我的畢業(yè)設(shè)計過程中給予了我熱情的幫助，從整個系統(tǒng)的需求分析、總體設(shè)計及某些細(xì)節(jié)之處到論文的撰寫都給予了具體指導(dǎo)。在畢業(yè)設(shè)計期間，老師淵博的學(xué)識，誨人不倦的精神，嚴(yán)謹(jǐn)治學(xué)的態(tài)度，以及對我們的嚴(yán)格要求都使我深深難忘，從中受益非淺。由于我是名新手，對制作一個這樣的完整的“數(shù)據(jù)結(jié)構(gòu)算法演示系統(tǒng)”有著許多的困難。相信在不斷的努力后，我會進(jìn)一步提高自己的水平，作出更好的成績。問題不足：(1)該系統(tǒng)相對復(fù)雜的演示系統(tǒng)稍顯簡易，只實現(xiàn)了結(jié)構(gòu)的基礎(chǔ)操作，對復(fù)雜算法的演示比較少，如多項式運算、最小生成樹等等；(2)在多數(shù)演示過程中，沒能實現(xiàn)單步演示。結(jié)束語通過幾個月的學(xué)習(xí)、實踐，在老師和同學(xué)幫助下，我所做的演示系統(tǒng)基本成型，下面闡述一下系統(tǒng)的有關(guān)情況。 算法說明操作操作運行如圖32所示。輸入幾個數(shù)字，再點選結(jié)點內(nèi)容，就產(chǎn)生如圖示，將鼠標(biāo)指針放在結(jié)點上方就會看到結(jié)點索引值；本范例索引值由0開始，左、右子樹對應(yīng)索引值，請留心樹狀結(jié)構(gòu)連接的方式，在構(gòu)建樹的同時，也順便比較內(nèi)容顯示；在本章二叉樹的構(gòu)建，都是在運行時產(chǎn)生新的類別控件，請留意圖形配置與連接的方式。如果看不清楚鏈表數(shù)據(jù)與指針動向的話，可以拉動右下方控制條來調(diào)整顯示窗口的背景亮度 樹操作樹運行如圖317 321 323所示輸入幾個數(shù)字就建立起二叉樹的結(jié)構(gòu)，請?zhí)貏e注意數(shù)字的大小與左右連接的關(guān)系；當(dāng)輸入的時候下方會出現(xiàn)輸入值在樹的第幾層信息。畫面初始設(shè)置加入指向為“由前”，在鏈表顯示窗口中單擊鼠標(biāo)右鍵，即彈出快捷菜單，單擊“加入結(jié)點”，連續(xù)加入兩筆數(shù)據(jù)即得圖示的結(jié)果，請隨時注意指針的變化；在“加入指向”面板中點選“往后”，再按右鍵加入兩筆數(shù)據(jù)，即可看見這兩筆數(shù)據(jù)是向后接續(xù)的；單擊鼠標(biāo)右鍵，選擇“插入接點”選項，即彈出“插入數(shù)據(jù)輸入框”，要求我們安排位置，我們將新數(shù)據(jù)計劃放在數(shù)據(jù)一后方，因此輸入數(shù)據(jù)一；之后彈出“數(shù)據(jù)輸入”的要求，我們輸入數(shù)據(jù)五；彈出項目管理對話框，告訴我們新結(jié)點的位置在第3結(jié)點；可發(fā)現(xiàn)圖中數(shù)據(jù)五已加入成為鏈表的第3個結(jié)點。單擊“加入”按紐以輸入數(shù)據(jù)，連續(xù)建立7個鏈表結(jié)點后單擊“顯示”按紐，即得到右方圖示的內(nèi)容；輸入“數(shù)據(jù)五”單擊“查找”按紐，就得到數(shù)據(jù)5在第3結(jié)點的信息；單擊“刪除”按紐，即跳出刪除結(jié)點的畫面，列表顯示中也少了數(shù)據(jù)五。在操作面板中輸入內(nèi)容后，單擊“奪后”按紐，即可看到數(shù)據(jù)從后面接續(xù)；當(dāng)數(shù)據(jù)超出面板時，以箭頭變化代表存取變化。在操作面板中輸入內(nèi)容后，單擊“按紐”即可看到數(shù)據(jù)從前方插入。 線性表操作線性表運行如圖333315所