Hot Search : Source embeded web remote control p2p game More...
Location : Home Downloads SourceCode Mathimatics-Numerical algorithms Data structs
  • Category : Data structs
  • Tags :
  • Update : 2012-11-26
  • Size : 200kb
  • Downloaded :0次
  • Author :tamaki******
  • About : Nobody
  • PS : If download it fails, try it again. Download again for free!
Download1 Download2
Don't use download software fo downloading.
If download fail,Try it again for free.
Introduction - If you have any usage issues, please Google them yourself
1、用随机函数生成10个待排序元素; 2、利用二叉查找树输出升序序列; 3、利用同一棵二叉查找树输出降序序列; 4、写出查找的递归函数;注意:递归出口的处理要求:二叉排序树的程序填空:修改 “BiSearchTree.h” 文件中的myorder()函数,得到二叉排序树的降序序列,要求达到BiSearchTree.exe的执行效果。 哈希查找: 1、 哈希表类的哈希函数采用除留余数法哈希函数; 2、 解决哈希冲突的函数采用开放定址法中的线性探察法。 3、 建立一个由10个数据元素组成的集合; 测试哈希表长度m=13和m=11两种情况下的哈希表,并查找其中的几个元素。
Packet file list
(Preview for download)
实验5\二叉排序、查找树\BiSearchTree.cpp
.....\................\BiSearchTree.exe
.....\................\BiSearchTree.h
.....\................\BTreeNode.h
.....\哈希表类\Datatype.h
.....\........\HashTable.cpp
.....\........\HashTable.exe
.....\........\HashTable.h
.....\实验五.doc
.....\二叉排序、查找树
.....\哈希表类
实验5
Related instructions
  • We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
  • The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
  • Please use Winrar for decompression tools
  • If download fail, Try it againg or Feedback to us.
  • If downloaded content did not match the introduction, Feedback to us,Confirm and will be refund.
  • Before downloading, you can inquire through the uploaded person information

Nothing.

Post Comment
*Quick comment Recommend Not bad Password Unclear description Not source
Lost files Unable to decompress Bad
*Content :
*Captcha :
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.