登录
首页 » Visual C++ » RBtree

RBtree

于 2014-05-16 发布 文件大小:8KB
0 122
下载积分: 1 下载次数: 5

代码说明:

  使用C++/C语言实现的红黑树,对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)

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

发表评论

0 个回复

  • mofanwenti
    魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)
    2014-01-08 22:30:48下载
    积分:1
  • StackandQueue
    该ppt包含了栈和队列的数据结构及基本操作,同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)
    2013-12-06 21:02:24下载
    积分:1
  • Ex3
    c++实现的静态链表 可以从屏幕输入来构建静态链表 数据结构重要的部分(c++ implemented statically linked list can be input from the screen to the important part to build a static linked list data structure)
    2012-11-27 15:19:25下载
    积分:1
  • paixu
    2008软件公司面试题:排序大全:简单选择排序、冒泡排序、选择排序、shell排序、快速排序、插入排序、堆排序(从小到大)、归并排序(利用递归)(2008 software companies face questions: Sort Guinness: simple choice to sort, bubble sort, select sort, shell sort, quick sort, insert sort HEAPSORT (from small to large), Merging Sort (recursive))
    2008-12-10 16:53:40下载
    积分:1
  • Circlist_Josephus3_4
    循环链表的应用 循环链表的应用 很方便的实现(cycle Chain cyclic chain of convenience Implementation)
    2006-11-23 19:36:47下载
    积分:1
  • KD-tree
    kd-树(k维搜索树)是把二叉搜索树推广到多维数据的一种主存数据结构。这里给出了其代码的VC++实现(Classic data structures- KD tree full implementation, with a detailed explanation of the code, the novice data structure good materials)
    2013-05-10 11:03:53下载
    积分:1
  • EightQueens
    数据结构与程序设计中的重点例子程序:八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)
    2009-06-29 14:52:11下载
    积分:1
  • Polynomial
    Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)
    2013-12-11 11:05:18下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • mathandos
    算法设计的动态规划,贪心算法 操作系统的银行家算法等五个小程序(data)
    2009-12-27 17:06:43下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载