搜索资源列表
transportation-bumbling
- 交通信号灯（Traffic Lights）或“红绿灯”，是以规定之时间上交互更换的光色讯号，通常设置于交岔路口或其他需要交通管制的地点，用以将道路通行权指定给车辆驾驶人与行人，管制其通行、停止及转向的交通管制设施。交通信号灯是以电力为能源运转之交通管制设施，以红、黄、绿三色灯号或辅以声音讯号，指示车辆及行人停止、注意与行进。-Traffic lights (Traffic Lights) or traffic lights , is the time to exchange the excha
8.2
- 利用二叉树层次遍历求二叉树的宽度（二叉树的宽度即二叉树同层结点数的最大值）(Judge the width of the two fork tree)
tunnnun
- 利用二叉树层次遍历求二叉树的宽度（二叉树的宽度即二叉树同层结点数的最大值）(The use of two tree level traversal to find the width of the two tree (two tree width, that is, the two fork tree with the maximum number of nodes))
Huffman编码(二叉树应用)
- Huffman编码（二叉树的应用）其中包含了源代码及实验截图(Huffman encoding (Application of two fork tree) Which contains the source code and experimental screenshots)
二叉搜索树的创建与遍历
- 简单描述了一个二叉搜索树的创建，并且进行先序，后序，中序遍历。(A simple descr iption of the creation of a two fork search tree, and the first order, after the order, in the order traversal.)
AVLTree
- 二叉平衡树类模板的实现，删除、插入和打印等功能。(Implementation of two fork balanced tree template)
箱子装载
- 运用多种数据结构完成箱子装载问题，包括二叉树算法，DBS树等(Use a variety of data structures to complete box loading problems, including two fork tree algorithm, DBS tree and so on)
xx
- 二叉树的建立，以及先序遍历，中序遍历，后序遍历(Two fork tree establishment, first order traversal, middle sequence traversal, after order traversal)
二叉链表
- 一、 实验目的 (一) 掌握二叉树的逻辑结构和二叉链表存储结构; (二) 验证二叉树的二叉存储和遍历及其基本操作的实现; (三) 理解算法与程序的关系，能够将顺序表算法转化为对应程序;(First, the purpose of the experiment (1) master the logical structure of the two tree and the storage structure of the two linked list; (two) verify the
fork
- lunix系统开发，进程调度等功能部分代码(Lunix system development, process scheduling and other functional parts of the code)
Project9
- 依次输入关键字并建立二叉排序树，实现二叉排序树的插入和查找功能，考察了对二叉排序树的掌握程度(In turn enter keywords and establish two fork sorting tree, to achieve the two fork sort tree insert and search function, inspected the two fork sorting tree master degree)
yuuter-monitor
- 操作系统实习报告编写一段程序,使用系统调用FORK创建两个子进程(Operating system internship report. Write a program to use the FORK system call to create two child process)
9
- 任意给定一组数据，设计一个算法，建立一棵二叉排序树，对它进行查找、插入、删除等操作(Arbitrary given a set of data, the design of an algorithm to establish a two fork sorting tree, it is to find, insert, delete, and other operations)
Balanced Binary Tree
- 平衡二叉树源代码 二叉树的格式化输出 可执行文件(Balanced two fork tree source code Two tree formatted output)
webbench-1.5.tar
- 一个在linux下使用的非常简单的网站压测工具。它使用fork()模拟多个客户端同时访问我们设定的URL，(A very simple site testing tool for use in linux. It uses fork () to simulate multiple clients while accessing our set of URL,)
a
- 编制一个程序,使其实现进程的软中断通信。父进程发信号控制子程序的终止。 使用系统调用fork()创建两个子进程,再用系统调用signal()让父进程捕捉键盘上的中断信号;当捕捉到中断信号后,父进程用系统调用Kill()向两个子进程发出信号,子进程捕捉到信号后分别输出下列信息后终止： Child Proeess 1 is Killed by Parent! Child Process 2 is Killed by Parent! 父进程等待两个子进程终止后,输出如下的信息
ExcelDataReader-develop
- Lightweight and fast library written in C# for reading Microsoft Excel files This project has just migrated from CodePlex - as is. Please feel free to fork and submit pull requests. Note Please try the latest source from the repo before reporti
biTree
- ? 按先序遍历的扩展序列建立二叉树的二叉链表存储结构，实现二叉树先序、中序、后序遍历的递归算法，实现二叉树中序遍历的非递归算法，实现二叉树层次遍历的非递归算法（要求使用顺序队列，调用顺序队列基本操作实现），求二叉树的深度(后序遍历)。(Two binary linked list storage structure - first traversal of the extended sequence according to the establishment of the two fork t
Bindnary Tree
- C++实现数据结构中二叉树的ADT 可实现创建 求最小二叉树等等功能(C++ data structure to achieve the two fork tree ADT, you can create, seek the minimum two fork tree, and so on)
222
- Fork is a PHP system developed by CMS, which is oriented to end users rather than designers and developers, so it is easy to use and is characterized by multi language support. Fork CMS uses a very simple user experience, including blogs, questions a