北京交通大学数据结构课件

上传者: pxzpxz | 上传时间: 2022-08-19 12:55:09 | 文件大小: 7.06MB | 文件类型: RAR
北京交通大学的数据结构课件,里面包括很多算法的讲解

文件下载

资源详情

[{"title":"( 94 个子文件 7.06MB ) 北京交通大学数据结构课件","children":[{"title":"数据结构","children":[{"title":"交大第九章.ppt <span style='color:#111;'> 831.50KB </span>","children":null,"spread":false},{"title":"必做编程题.doc <span style='color:#111;'> 19.00KB </span>","children":null,"spread":false},{"title":"数据结构-冯凤娟.rar <span style='color:#111;'> 1.58MB </span>","children":null,"spread":false},{"title":"数据结构-冯凤娟","children":[{"title":"数据结构-冯凤娟","children":[{"title":"C程序设计.ppt <span style='color:#111;'> 231.50KB </span>","children":null,"spread":false},{"title":"交大第九章.ppt <span style='color:#111;'> 831.50KB </span>","children":null,"spread":false},{"title":"必做编程题.doc <span style='color:#111;'> 19.00KB </span>","children":null,"spread":false},{"title":"分配的编程题.doc <span style='color:#111;'> 19.00KB </span>","children":null,"spread":false},{"title":"交大第七章.ppt <span style='color:#111;'> 949.50KB </span>","children":null,"spread":false},{"title":"习题讲解.doc <span style='color:#111;'> 34.00KB </span>","children":null,"spread":false},{"title":"交大第六章.ppt <span style='color:#111;'> 1019.50KB </span>","children":null,"spread":false},{"title":"交大第二章.ppt <span style='color:#111;'> 1.23MB </span>","children":null,"spread":false},{"title":"交大第一章.ppt <span style='color:#111;'> 518.00KB </span>","children":null,"spread":false},{"title":"本科数据结构作业.doc <span style='color:#111;'> 22.00KB </span>","children":null,"spread":false},{"title":"绪论.ppt <span style='color:#111;'> 187.00KB </span>","children":null,"spread":false},{"title":"交大第五章.ppt <span style='color:#111;'> 735.00KB </span>","children":null,"spread":false},{"title":"习题6.ppt <span style='color:#111;'> 132.50KB </span>","children":null,"spread":false},{"title":"交大第三章.PPT <span style='color:#111;'> 1.38MB </span>","children":null,"spread":false},{"title":"交大第十章.ppt <span style='color:#111;'> 1.13MB </span>","children":null,"spread":false},{"title":"交大第十(一)章.ppt <span style='color:#111;'> 802.00KB </span>","children":null,"spread":false},{"title":"交大第四章.ppt <span style='color:#111;'> 405.50KB </span>","children":null,"spread":false}],"spread":false}],"spread":true},{"title":"分配的编程题.doc <span style='color:#111;'> 19.00KB </span>","children":null,"spread":false},{"title":"交大第七章.ppt <span style='color:#111;'> 951.50KB </span>","children":null,"spread":false},{"title":"DS","children":[{"title":"第二章(学生).ppt <span style='color:#111;'> 806.00KB </span>","children":null,"spread":false},{"title":"第一章习题.doc <span style='color:#111;'> 22.50KB </span>","children":null,"spread":false},{"title":"第一章(学生).ppt <span style='color:#111;'> 374.50KB </span>","children":null,"spread":false}],"spread":true},{"title":"数据结构-第三章习题-王方石.doc <span style='color:#111;'> 33.00KB </span>","children":null,"spread":false},{"title":"作业.rar <span style='color:#111;'> 4.02KB </span>","children":null,"spread":false},{"title":"数据结构与算法设计.rar <span style='color:#111;'> 189.42KB </span>","children":null,"spread":false},{"title":"习题讲解.doc <span style='color:#111;'> 34.00KB </span>","children":null,"spread":false},{"title":"数据结构与算法设计","children":[{"title":"第二章(学生).ppt <span style='color:#111;'> 806.00KB </span>","children":null,"spread":false},{"title":"第一章习题.doc <span style='color:#111;'> 22.50KB </span>","children":null,"spread":false},{"title":"第一章(学生).ppt <span style='color:#111;'> 376.50KB </span>","children":null,"spread":false}],"spread":true},{"title":"交大第六章.ppt <span style='color:#111;'> 1017.50KB </span>","children":null,"spread":false},{"title":"交大第二章.ppt <span style='color:#111;'> 1.23MB </span>","children":null,"spread":false},{"title":"交大第一章.ppt <span style='color:#111;'> 518.00KB </span>","children":null,"spread":false},{"title":"数据结构作业 彭显志 07301039 (2).rar <span style='color:#111;'> 483.58KB </span>","children":null,"spread":false},{"title":"本科数据结构作业.doc <span style='color:#111;'> 22.00KB </span>","children":null,"spread":false},{"title":"绪论.ppt <span style='color:#111;'> 187.00KB </span>","children":null,"spread":false},{"title":"交大第五章.ppt <span style='color:#111;'> 732.50KB </span>","children":null,"spread":false},{"title":"Thumbs.db <span style='color:#111;'> 7.00KB </span>","children":null,"spread":false},{"title":"交大第六章 [自动保存的].ppt <span style='color:#111;'> 3.28MB </span>","children":null,"spread":false},{"title":"习题6.ppt <span style='color:#111;'> 132.50KB </span>","children":null,"spread":false},{"title":"数据结构.rar <span style='color:#111;'> 189.30KB </span>","children":null,"spread":false},{"title":"数据结构作业","children":[{"title":"后序遍历的非递归算法.txt <span style='color:#111;'> 1.67KB </span>","children":null,"spread":false},{"title":"折半查找.txt <span style='color:#111;'> 1.52KB </span>","children":null,"spread":false},{"title":"中序遍历非递归.txt <span style='color:#111;'> 1.36KB </span>","children":null,"spread":false},{"title":"图的深度遍历.txt <span style='color:#111;'> 875B </span>","children":null,"spread":false},{"title":"折半插入排序.txt <span style='color:#111;'> 940B </span>","children":null,"spread":false},{"title":"k阶斐波那契那数列-彭","children":[{"title":"fb.plg <span style='color:#111;'> 1.21KB </span>","children":null,"spread":false},{"title":"fb.dsp <span style='color:#111;'> 4.14KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"fb.pch <span style='color:#111;'> 198.95KB </span>","children":null,"spread":false},{"title":"vc60.pdb <span style='color:#111;'> 44.00KB </span>","children":null,"spread":false},{"title":"fb.obj <span style='color:#111;'> 4.70KB </span>","children":null,"spread":false},{"title":"vc60.idb <span style='color:#111;'> 33.00KB </span>","children":null,"spread":false},{"title":"fb.pdb <span style='color:#111;'> 409.00KB </span>","children":null,"spread":false},{"title":"fb.exe <span style='color:#111;'> 160.07KB </span>","children":null,"spread":false},{"title":"fb.ilk <span style='color:#111;'> 180.14KB </span>","children":null,"spread":false}],"spread":false},{"title":"fb.opt <span style='color:#111;'> 47.50KB </span>","children":null,"spread":false},{"title":"fb.dsw <span style='color:#111;'> 529B </span>","children":null,"spread":false},{"title":"fb.cpp <span style='color:#111;'> 1.25KB </span>","children":null,"spread":false},{"title":"fb.ncb <span style='color:#111;'> 33.00KB </span>","children":null,"spread":false}],"spread":false},{"title":"顺序查找.txt <span style='color:#111;'> 937B </span>","children":null,"spread":false},{"title":"冒泡排序.txt <span style='color:#111;'> 830B </span>","children":null,"spread":false},{"title":"先序遍历的非递归算法.txt <span style='color:#111;'> 1.45KB </span>","children":null,"spread":false},{"title":"递归遍历.txt <span style='color:#111;'> 1.51KB </span>","children":null,"spread":false},{"title":"树的深度.txt <span style='color:#111;'> 1.18KB </span>","children":null,"spread":false},{"title":"queen.rar <span style='color:#111;'> 158.84KB </span>","children":null,"spread":false},{"title":"简单选择排序.txt <span style='color:#111;'> 969B </span>","children":null,"spread":false},{"title":"先序建立二叉树.txt <span style='color:#111;'> 803B </span>","children":null,"spread":false},{"title":"求二叉树的深度(后序遍历).txt <span style='color:#111;'> 1.17KB </span>","children":null,"spread":false},{"title":"约瑟夫环","children":[{"title":"约瑟夫环.dsw <span style='color:#111;'> 541B </span>","children":null,"spread":false},{"title":"约瑟夫环.ncb <span style='color:#111;'> 33.00KB </span>","children":null,"spread":false},{"title":"约瑟夫环.plg <span style='color:#111;'> 1.24KB </span>","children":null,"spread":false},{"title":"new.cpp <span style='color:#111;'> 1.55KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"new.obj <span style='color:#111;'> 5.19KB </span>","children":null,"spread":false},{"title":"vc60.pdb <span style='color:#111;'> 52.00KB </span>","children":null,"spread":false},{"title":"约瑟夫环.ilk <span style='color:#111;'> 173.71KB </span>","children":null,"spread":false},{"title":"vc60.idb <span style='color:#111;'> 41.00KB </span>","children":null,"spread":false},{"title":"约瑟夫环.pdb <span style='color:#111;'> 417.00KB </span>","children":null,"spread":false},{"title":"约瑟夫环.pch <span style='color:#111;'> 198.95KB </span>","children":null,"spread":false},{"title":"约瑟夫环.exe <span style='color:#111;'> 160.08KB </span>","children":null,"spread":false}],"spread":false},{"title":"约瑟夫环.dsp <span style='color:#111;'> 4.20KB </span>","children":null,"spread":false},{"title":"约瑟夫环.opt <span style='color:#111;'> 47.50KB </span>","children":null,"spread":false}],"spread":false},{"title":"前缀表达式求值.txt <span style='color:#111;'> 1.37KB </span>","children":null,"spread":false},{"title":"最小生成树.txt <span style='color:#111;'> 1.43KB </span>","children":null,"spread":false},{"title":"层次的非递归算法.txt <span style='color:#111;'> 1.55KB </span>","children":null,"spread":false},{"title":"图的邻接矩阵建造.txt <span style='color:#111;'> 473B </span>","children":null,"spread":false}],"spread":false},{"title":"交大第三章.PPT <span style='color:#111;'> 1.38MB </span>","children":null,"spread":false},{"title":"交大第十章.ppt <span style='color:#111;'> 1.13MB </span>","children":null,"spread":false},{"title":"交大第十(一)章.ppt <span style='color:#111;'> 802.00KB </span>","children":null,"spread":false},{"title":"交大第四章.ppt <span style='color:#111;'> 405.50KB </span>","children":null,"spread":false},{"title":"数据结构","children":[{"title":"DS","children":[{"title":"第二章(学生).ppt <span style='color:#111;'> 806.00KB </span>","children":null,"spread":false},{"title":"第一章习题.doc <span style='color:#111;'> 22.50KB </span>","children":null,"spread":false},{"title":"第一章(学生).ppt <span style='color:#111;'> 376.50KB </span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":false}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明