搜索资源列表
Tree_Drag
- 实现树的拖动,从一个节点到令一节点, 可以自动的判断是否可以添加或介绍,是学习树拖拽的好参考-Drag the realization of the tree from one node to make a node, you can automatically determine whether you can add or introduction, is to learn from the tree drag the good reference
cut_branch
- “裁枝剪叶”问题 文件名:cut.* 输入文件:cut.in(文本文件,选手按规定格式自行创建) 输出文件:cut.out(文本文件) 问题描述: 一个无向连通图中有N个节点,N-1条边,则该图称为“无根树”。无根树中任何两个节点之间有且只有一条包含最少边的路径。 所谓“裁枝剪叶”,就是去掉无根树中的一条边,这样一棵无根树就被分成了两棵无根树,丢掉其中的一棵,还剩一棵;对剩下的一棵再进行“裁枝剪叶”。经过一系列这样的“裁枝剪叶”后,最后剩下一棵无根树。 若开始时
BST_path
- 二叉搜索树求每个结点到根节点的路径 非递归的先序,中序,后序遍历-Binary search tree for each node to the root path of the first non-recursive sequence, in order, after the traversal
mayetree
- 实现N叉树的建立、节点插入、删除、查找等。在devC环境下编译运行正常。-N-tree to achieve the establishment of the node insert, delete, search and so on. In the circumstances devC compiler operating normally.
B-
- 三阶B-树的节点插入与删除 三阶B-树的节点插入与删除-Third-order B-tree node insertion and deletion of third-order B-tree node insert and delete
TREE
- 二叉树的实现,包括前序、中序、后序和层次遍历,输出,计算叶子节点等函数。-Binary tree realization, including the former sequence, in order, after the traversal sequence and levels of output, computing functions, such as leaf nodes.
binarytree
- 二叉树的操作,程序采用递归可进行树的遍历,求叶子节点的个数,交换左右子树等操作-Binary operation, the procedure can be carried out using recursive tree traversal, and the number of leaf nodes, exchange and other operations around subtree
wztree
- javascr ipt实现的节点树,无限分级 还带有详细的使用说明,-javascr ipt to achieve the node tree, unlimited classification also with detailed instructions,
btree.tar
- b树的实现,包括打开关闭节点,打开节点 关闭节点,打开所有节点,关闭所有节点, 打开子节点,显示当前节点的增加节点 增加多个节点,删除节点-b-tree to achieve, including the closure of the node to open, open the node closed node, open to all nodes, the closure of all nodes, open the child nodes, indicating an in
BitTree
- 用VC界面模拟二叉树算法,添加,删除,修改节点-VC interface with binary tree algorithm simulation, add, delete, modify nodes
1
- 建立二叉树 中序遍历二叉树算法 计算二叉树的节点-Set up tree traversal in binary tree algorithm binary tree node
tree
- js解析xml文件,涉及到遍历树及节点。 是非常有用的html工具-javascr ipt and xml
dtreetreemenu
- 实现了动态的树状菜单,可以任意添加子节点!非常实用!-Achieve a dynamic tree menu can add child nodes! Very useful!
BinTree
- 请编写一个程序,确定二叉树的特征。如:每个节点的层次,从根到该节点的枝长(路径长度),子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-Please write a procedure to determine the characteristics of binary tree. Such as: the level of each node from the root to the node of the branch length (path length), the n
shiyan
- 实现了循环便利一棵树,查找叶子节点等功能!-Facilitate the implementation of the cycle of a tree, leaf nodes, such as search function!
BiTreeNode3
- 实现二叉树左孩子,右兄弟的编码方法,输入节点名称和左右编号,即可给出二叉树。-Children left to achieve binary tree, right brothers coding method, enter the node name and number around, you can give tree.
TreeExamination
- 用MFC做的,一个对默认生成N多个节点的对,可以对树进行排序.-Using MFC to do, and a default generating N number of nodes that can be sort of tree.
bintree
- 二叉排序树,包括插入节点、删除节点、中序线索化、中序遍历等功能-Binary sort tree, including the insert node, delete node, in the sequence of clues, in the traversal functions
Binary_Tree
- Binary_tree.cpp :执行文件生成所有二叉树 这样做的目的C + +程序是产生所有二叉树指定节点数目。 基本思想是衍生所有二叉树基于退化树。 该算法的动机是圆括号法则代表二叉树。 一组括号可通过字典秩序排列,由此也可以产生二叉树。但该算法代码中并没有简单地转换括号代表性 它一直在改变过去的节点从最新二叉树下一可能位置(在这里,我们假设右向是正确的退化树方向) 。 该文件还提到计算机内存时(读/写)和avarage参考值。 这个工程在Microsof
dynamicTree
- 动态加载树,点一个节点时,用ajax到数据库去取该节点的子节点-Dynamic loading tree node points, the use of ajax to the database to fetch the child nodes of the node