搜索资源列表
tree-control
- vc编写的树形控件，可以修改结点名称，拖动等-tree control written in vc, can modify the node name, drag, etc.
tree
- treeview控件与数据库连接、操作实例，具体修改、添加、删除节点的功能，可供学习。-treeview control with the database connection, the operation instance, specific changes, add, delete node function, available for study.
Virtual.Tree.View.Ver.4.5.2.Source
- Tree View VCL Control for Delphi with Source this control uses a different paradigm for tree management than other controls of this kind. It does not know anything about the data it manages (except its size), not even the captions of a node. Ever
tree
- 可以有多层目录的树控件,连接数据库,自由的添加删除节点!-Can have multi-directory tree controls, connect database, free to add delete the node!
B-
- 三阶B-树的节点插入与删除 三阶B-树的节点插入与删除-Third-order B-tree node insertion and deletion of third-order B-tree node insert and delete
ext-tree
- ext的树的实例.通过右键菜单操作树节点对数据库进行增删改查.-Examples of trees ext. through the operation menu tree node additions and deletions to the database search.
draw-tree
- 伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.-The tree is drawn in such a way that both of the edges
li
- c语言实现的数据结构中线形表的应用,包括二叉树结点的插入,删除,查询等-c language data structure in binary tree of applications, including binary tree node insert, delete, query, etc. -XIANXINGBIAOYINGYONG
tree
- 拖拉树节点，用于VB开发。可以生成拖拉树型的界面和功能。-Drag the tree node
delphi_qxgl
- 用delphi写的用户权限管理 修改了权限树节点状态生成过程，采用循环遍历树结点 修改了主界面菜单和工具条显示过程，采用递规遍历菜单 通过系统管理员进入sys权限设置，在mainfrom创建的时候读取权限。 权限设置模块中可根据需要改为：将树型结构的节点写进数据库，进行动态修改。在程序中动态生成树型结构 过系统管理员:sys 密码:sys 普通用户:001 密码:123 用VB、VS等开发工具可参考设计。-Use delphi wr
Tree
- 二叉树基本操作的程序实验 1、二叉树结点结构体 2、二叉树结点队列-Experimental procedure for the basic operation of a binary tree 1, a binary tree node structure 2, a binary tree node queue
tree
- 二叉树的实现 孩子兄弟节点法完成二叉树的各种遍历操作 课程设计-Binary tree node method to achieve complete binary brothers kids of various traversal operation of curriculum design
2-3-Tree
- 2-3 Tree implementation wich can insert search a node and always shows in graphical the tree.
bin-tree
- 二叉树类及其实现以二叉链表为存储结构实现二叉树类和成员函数， 设计计算二叉树结点、将二叉树每个结点的左右子树交换、求二叉树高度的算法-Binary tree class and its implementation to the list for the storage structure of the binary classes and member functions to achieve a binary tree, binary tree node design calculati
tree
- 遍历树,用于存储节点信息及其他查找树操作,仅供学习参考-Traverse the tree, for storing information and other search tree node operation, only to learn information
delete-AVL-tree
- 武汉大学的数据结构C++版实验，要求实现AVL树结点删除-Wuhan University' s version of C++ data structure experiments required to achieve AVL tree node to delete
binary-tree
- 该文件描述了二叉树的链式存储结构。 相关性质。结点和结点间关系的基本概念；二叉树的链式存储结构。了解树的结点访问的方法。掌握二叉树的链式存储结构； 二叉树结点的递归访问方法。二叉树的遍历。二叉树的线索化及其应用 -The document describes the Storage Structure of the binary tree. Related properties. Nodes and nodes of the basic concepts of the relat
binary-tree
- 二叉树的创建，二叉树中结点的查找，测二叉树的深度宽度，输出二叉树的叶子结点-Binary tree creating, search binary tree node , the binary tree s depth and width, output binary tree leaf nodes
binary-tree
- 建立了一个二叉树，写出二叉树的结点，然后用前序历遍、中序历遍、后序历遍来访问了整棵二叉树。-A binary tree, write a binary tree node, and then use the pre-order the calendar over the calendar times in sequence, after the sequence to access the calendar over the whole grain binary tree.
adt-tree
- 二叉排序树：又称二叉查找树。 它或者是一棵空树；或者是具有下列性质的二叉树： （1）若左子树不空，则左子树上所有结点的值均小于它的根结点的值； （2）若右子树不空，则右子树上所有结点的值均大于它的根结点的值； （3）左、右子树也分别为二叉排序树；-Binary sort tree: also known as binary search tree. Or an empty tree or a binary tree with the following properties: (1) If t