- 1、本文档共8页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
重庆大学数据结构09_linearlist_05
Data Structure Linear Lists_05 Data Structure 01 Course Overview Data Structure College of Computer Science, CQU Unit9 Lists seminar 1. In the linked list implementation presented in Section 4.1.2, the current position is implemented using a pointer to the element ahead of the logical current node. The more “natural” approach might seem to be to have curr point directly to the node containing the current element. However, if this was done, then the pointer of the node preceding the current one cannot be updated properly because there is no access to this node from curr. An alternative is to add a new node after the current element, copy the value of the current element to this new node, and then insert the new value into the old current node. (a) What happens if curr is at the end of the list already? Is there still a way to make this work? Is the resulting code simpler or more complex than the implementation of Section 4.1.2? (b) Will deletion always work in constant time if curr points directly to the current node? In particular, can you make several deletions in a row? Subjects 2. Write a function that reverses the order of the elements on the list(stored by array_based list and singly link list). Your algorithm should run in O(1) space complexity. 3. Write a function to merge two lists list(stored by array_based list and singly link list). The input lists have their elements in sorted order, from lowest to highest. The output list should also be sorted from lowest to highest. Subjects 4. A circular linked list is one in which the next ?eld for the last link node of the list points to the ?rst link node of the list. This can be useful when you wish to have a relative positioning for elements, but no concept of an absolute ?rst or last position. (a) Modify the code of Figure 4.8 to implement circular singly linked lists. (b) Modify the code of Figure 4.14 to implement circular doubly linked lists. 5. Implement Josephues problem use circular linked list Subjec
您可能关注的文档
- 酸碱失衡的病理.ppt
- 酸碱排气系统培训文件(上海盛剑).ppt
- 采用无线方式对变电站进行温度检测.doc
- 采矿概论第十二讲.ppt
- 释义Oracle11r2中并行执行相关参数.docx
- 里根总统演讲中英文.doc
- 酶-04-J.ppt
- 酒店消防演示文稿1.ppt
- 酶的别构调控.ppt
- 采煤机记忆割煤演示FaceBoss Memory Cut_Chinese.ppt
- 中国行业标准 GM/T 0126-2023HTML密码应用置标语法.pdf
- 《JJF 2121-2024恒转速源校准规范》.pdf
- 餐饮服务中20条处理要点.docx
- 《GM/T 0011-2023可信计算 可信密码支撑平台功能与接口规范》.pdf
- 《JJF 2134-2024旋转流变仪校准规范》.pdf
- JJF 2121-2024恒转速源校准规范.pdf
- 计量规程规范 JJF 2121-2024恒转速源校准规范.pdf
- 《JJF 2118-2024压力式六氟化硫气体密度控制器校验仪校准规范》.pdf
- JJF 2134-2024旋转流变仪校准规范.pdf
- 计量规程规范 JJF 2134-2024旋转流变仪校准规范.pdf
文档评论(0)