资源列表
tree
- 二叉树的遍历问题中关于使用二叉树进行表达式求值-Binary Tree Traversal issues on the use of the expression tree for evaluation
Queen
- n皇后 在一定范围内，可以输出n皇后问题的所有解。-solve the "n queen" problem.
txhafuman
- 贪心算法实现哈弗曼编码，在vc里面即可运行。-Greedy algorithm哈弗曼coding, which can be run in the vc.
bitre
- 第一题：求二叉树的高度 第二题:输出二叉树中各节点的值及所对应的层次数 第三题：数组二叉树转化成链式二叉树 第四题：复制二叉树T1到T 第五题：交换左右孩子节点的指针的值 第六题：先序创建二叉数-this is a bitree , there are six functions
nqueen
- 该程序利用C++环境，实现了N皇后问题。当输入的皇后个数是13时，运行速度还相当可以。当个数增加到14的时候，运行速度就相对慢了下来，不过运行出正确的结果是没有问题的。-This process uses the c++ circumstance,and it accomplished the N Queens problem.when the input number is 13,the running speed is at a fairly rapid pace.when the inpu
1100(tree)
- HDOJ第1100题解题报告，有详细说明和代码-detailed analysis of problem 1100 of HDOJ
stack_math_calc
- 数据结构实验。用栈来实现数学运算。给初学数据结构的同学学习。-Experimental data structure. Used to achieve arithmetic stack. Data structure to novice students to learn.
jp1
- c的数据结构 课程设计 航空订票 系统 功能齐全，注释详尽-c data structure curriculum design air booking system functions, detailed notes
DTree
- D-Tree是在机器学习的领域中一项非常重要的概念，D-Tree可以将大幅度地提高以前数的结构的效率。上传的文件中实现了一个最基本的D-Tree，并带有三个样例。-D-Tree is in the field of machine learning a very important concept, D-Tree can be significantly improved before the structure of a number of efficiency. From the paper
111
- 此程序利用线程模拟进程，用p、v原语操作实现生产者与消费者的问题。-This procedure simulated the process of using thread, with p, v primitive operations to achieve the producer and consumer issues.
1234
- 页式虚拟存储管理中地址转换与缺页中断 分页存储管理将一个进程的逻辑地址空间分成若干大小相等的片，称为页面或页。-Virtual Storage Management page in the address translation page fault paging and storage management will be a process of logical address space divided into equal size chip, known as the page o
12344
- 模拟银行家算法 页式存储管理如何实现地址转换；进一步认识页式虚拟存储管理中如何处理缺页中断。用C++实现LRU置换算法 -Bankers algorithm simulation storage management page addresses how to achieve the conversion a better understanding of virtual memory management page of how to handle page fault. Using