数据结构与算法分析C版答案.docx

Data Structures and Algorithm 习题答案 Preface ii Data Structures and Algorithms 1 Mathematical Preliminaries 5 Algorithm Analysis 17 Lists, Stacks, and Queues 23 Binary Trees 32 General Trees 40 Internal Sorting 46 File Processing and External Sorting 54 9Searching 58 Indexing 64 Graphs 69 Lists and Arrays Revisited 76 Advanced Tree Structures 82 i ii Contents Analysis Techniques 88 Limits to Computation 94 Preface Contained herein are the solutions to all exercises from the textbook A Practical Introduction to Data Structures and Algorithm Analysis, 2nd edition. For most of the problems requiring an algorithm I have given actual code. In a few cases I have presented pseudocode. Please be aware that the code presented in this manual has not actually been compiled and tested. While I believe the algorithms to be essentially correct, there may be errors in syntax as well as semantics. Most importantly, these solutions provide a guide to the instructor as to the intended answer, rather than usable programs. 1 Data Structures and Algorithms chapterintegerInstructor 's note: Unlike the other chapters, many of the questions in this are not really suitable for graded work. The questions are mainly intended to get students thinking about data structures issues. chapter integer 1.1 This question does not have a specific right answer, provided the student keeps to the spirit of the question. Students may have trouble with the concept of “operations. ” 1.2 This exercise asks the student to expand on their concept of an representation. A good answer is described by Project 4.5, where a singly-linked list is suggested. The most straightforward implementation stores each digit in its own list node, with digits stored in reverse order. Addition and multiplication are implemented by what amounts to grade-school arithmetic. For addition, simply march down in parallel through the two lists representing the operands, at each digit appending to a new list the appropriate partial sum and b