搜索资源列表
sichashu
- 如果把地图分成块，只筛选范围覆盖的块中的单位，这样就可以减少很多不必要的筛选。四叉树可以有效解决这个问题。 树的每一层都把地图划分四块，根据地图尺寸来决定树的层数，层数越大划分越细。 当需要对某一范围的单位筛选时，只需要定位到与范围相交的树区域，再对其区域内的对象筛选即可。(If you map the map into blocks, you filter only the units in the block covered by the range, thus reducing
二叉树排序
- 二叉树进行排序，可以计算一列数的大小关系(Two fork tree sorting, you can calculate the size of a column of the relationship)
webbench-1.5.tar
- Webbench 是一个在 Linux 下使用的非常简单的网站压测工具。它使用 fork ()模拟多个客户端同时访问我们设定的 URL，测试网站在压力下工作的性能，最多可以模拟 3 万个并发连接去测试网站的负载能力。Webbench 使用C语言编写， 代码实在太简洁，源码加起来不到 600 行。(Webbench is a very simple site testing tool for use in Linux. It uses fork () to simulate multiple cl
uart
- Linux上串口读写程序，首先打开串口，对其进行设置，然后产生一个子进程对子进行对串口进行读，父进程对串口进行写操作。(The demo is used for reading and writing the uart in Linux, there are two thread, the parent fork write the uart, the child thread read it.)
BinaryTree
- 二叉树前序中序后序遍历遍历代码，使用c++编写(Two fork tree preorder, in order, after traversal traversal code, using c++ write)
DSA_CPP
- 使用C++实现向量，链表，二叉树类，对应有相应的测试(Using C++ implementation vector, linked list, two fork tree class, corresponding to the corresponding test)
binaryTree
- 使用c++实现数据结构二叉树建立。使用了c++中类的概念(The use of c++ data structure, the establishment of two fork tree.)
binaryHeap
- 使用c++实现数据结构二叉堆，代码运行环境采用clion(Using c++ to achieve data structures two fork heap, code running environment using clion)
Moving Average
- 均线金叉死叉作为开仓和平仓条件，做为学习用，实盘呵呵(Average gold fork fork died as a condition of open warehouse peace warehouse, as learning to use, firm ha ha)
forkcms
- Fork CMS is a PHP system developed by CMS, which is oriented to end users rather than designers and developers, so it's easy to use it. Support multi language. Fork CMS uses a very simple user experience, including blogs, questions and answers, forms
Problem1
- 用各种方法遍历二叉树.好好好好哦啊哦龚波负(Various methods traverse two fork tree)
BinomialTree_AmericanPricing(2)
- 美式二叉树的计算公式，方便快捷，参数可自由设置(Formula of American two fork tree)
tree
- PHP实现二叉树，PHP + html 实现二叉树显示(PHP implementation of two fork tree, PHP + HTML implementation, two fork tree display)
jtuc-winmerge2011-3ae76c87f792
- The WinMerge 2011 series is a fork of the original WinMerge application published on SourceForge by Thingamahoochie Software. It is an escape from the [complex situation](http://forums.winmerge.org/viewtopic.php?f=4&t=352&start=10#p1384) that
二叉树
- 数据结构中的二叉树结构，使用的语言应该是C++(Data structure of the two fork tree structure, the use of language should be C++)
二叉树的基本操作
- 二叉树的先序，中序，后序，层序递归和非递归实现，总节点个数和叶子节点个数，二叉树的高度等基本操作(Two binary tree first order, middle order, backward sequence, sequence recursive and non recursive implementation, the total number of nodes and the number of leaf nodes, the height of the two fork tre
利用二叉树求值
- 运用二叉树求表达式值 根据表达式 构建二叉树 建立波兰式 求出值。(Using the two tree to calculate the expression value, construct two fork tree according to the expression, and establish the Poland type value.)
Binary tree
- 利用平衡二叉树，将输入数字排列成左小右大的二叉树，内附代码和文件说明(Using the balanced binary tree, the input number is arranged into a left small right large two fork tree, with the enclosing code and file descr iption)
BTree
- 遍历二叉树（前序，中序，后序），包括二叉树的创建，此二叉树为链式二叉树，是手动创建的(Traversing the two fork tree (preorder, middle order, post order))
150603118朱慧宇
- 关于二叉树的使用的数据结构的程序以及报告(this is the use of two fork tree)