二叉排序树与平衡二叉排序树基本操作的实现 文本文档(Two fork sorting tree and balance two fork sort tree, the basic operation of the realization of text documents).docVIP

二叉排序树与平衡二叉排序树基本操作的实现 文本文档(Two fork sorting tree and balance two fork sort tree, the basic operation of the realization of text documents).doc

  1. 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
二叉排序树与平衡二叉排序树基本操作的实现 文本文档(Two fork sorting tree and balance two fork sort tree, the basic operation of the realization of text documents)

二叉排序树与平衡二叉排序树基本操作的实现 文本文档(Two fork sorting tree and balance two fork sort tree, the basic operation of the realization of text documents) Panzhihua University undergraduate course design task book Topic two fork sorting tree and balance two fork tree implementation 1, the purpose of curriculum design To further understand and master the logic structure, storage structure and operation implementation algorithms of various basic abstract data types, and how to use them in programs. Enable students to master the basic content and design methods of software design, and train students ability to standardize software design. 3) to enable students to master the use of various computer materials and reference materials, to improve the basic ability of students to program design. 2, curriculum design content and requirements (including raw data, technical requirements, job requirements, etc.) (1) (1) to enter (\n) for the end of the input flag, enter the sequence L, generate a two fork sorting tree T; (2) for two fork sorting tree T in order traversal, the output results; (3) calculate the two fork sorting tree, T search success average search length, the output results; (4) input element x, find the two fork sorting tree T, if there is a node containing x, then delete the node, and in order traversal (operation 2); otherwise, output information NO x; (5) with the sequence of L, the two generation balanced binary sort tree BT: when inserting new elements, found that two of the current two binary sort tree binary sort tree BT is not balanced, then two binary sort tree it into a new balance BT; (6) calculate the average search length of the balanced two fork sorting tree BT, and output the result. 3. Main references 1 Liu Dayou, data structure (C language version), higher education press [2] Yan Yumin et al. Data structure (C Language Edition), Tsinghua University press [3] William, Ford, William, Topp, Data, Structure, with, C++, Tsinghua University press [4] Su Shihua et al.

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档