一个WEB的TREE控件
上传时间： 2015-01-20
上传用户：songrui
数据结构中的AVL TREE的实现
上传时间： 2014-11-02
上传用户：3到15
数据结构中的B-TREE的实现
上传时间： 2014-01-07
上传用户：小儒尼尼奥
Binary Search Tree - with additional recursion functions (smallest, parent & successor) etc
标签： additional recursion functions successor
上传时间： 2014-11-28
上传用户：sxdtlqqjl
AVL Tree的实现
上传时间： 2014-06-15
上传用户：wsf950131
apsx 网页tree控制
上传时间： 2015-02-18
上传用户：wlcaption
图书管理程序,b-tree,c++语言完成。程序非常的棒
上传时间： 2013-12-19
上传用户：love1314
Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。
标签： Addison-Velski AVL-Tree Landis 二叉树
上传时间： 2013-12-25
上传用户：yuzsu
The code assumes a two-dimensional computational domain with TMz polarization (i.e., non-zero field Ez, Hx, and Hy). The program is currently written so that the incident field always strikes the lower-left corner of the total-field region first. (If you want a different corner, that should be a fairly simple tweak to the code, but for now you ll have to make that tweak yourself.) I have attempted to provide copious comments in the code and hope that a knowledgeable C programmer can quickly map the approach as described in the paper to what is in the program.
标签： two-dimensional computational polarization non-zero
上传时间： 2013-12-13
上传用户：cylnpy
SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.
标签： high-dimensional structure neighbor SR-tree
上传时间： 2013-12-10
上传用户：zjf3110
