登录
首页 » Visual C++ » BinarySortTree

BinarySortTree

于 2009-12-03 发布 文件大小:192KB
0 196
下载积分: 1 下载次数: 4

代码说明:

  二叉排序树,可以实现插入,删除,查找,创建功能(Binary sort tree,you can achieve the insert,delete,search,create functional)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • ddt
    多段图、遍历、排序。用C语言解决多段图中的成本问题,得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )
    2012-05-12 13:49:10下载
    积分:1
  • Brute-force-algorithm
    穷举算法,VC中的经典程序之一,适合初学者,(Brute-force algorithm, the the of the classic procedures in in the the VC, suitable for beginners)
    2012-06-06 21:20:06下载
    积分:1
  • Lecture6
    数据结构中链式队列和堆栈的循环用法,非常有用(Queue data structure in the chain and the cycle stack usage, very useful)
    2011-07-27 15:30:29下载
    积分:1
  • code1
    键盘任意输入一组字母或数字生成无序数组,对数组按ASCII顺序进行排序(排序要求至少用两种排序算法),再从键盘输入一个值进行二分查找,返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)
    2010-07-14 11:42:56下载
    积分:1
  • list-and-array
    数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
    2013-10-17 11:32:30下载
    积分:1
  • DouglasPeucker
    道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)
    2011-08-28 19:04:29下载
    积分:1
  • abc
    数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)
    2013-12-03 15:57:53下载
    积分:1
  • the-dynamic-planning
    本文讨论了动态规划这一思想的核心内容和其基本特点,探讨了动态规划思想的适用范围,动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )
    2011-12-15 16:49:05下载
    积分:1
  • bstree_frame
    利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
    2013-08-10 16:43:50下载
    积分:1
  • backtrackng
    给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品,使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)
    2017-01-01 17:51:23下载
    积分:1
  • 696516资源总数
  • 106436会员总数
  • 7今日下载