搜索资源列表
E3TREE
- 一个功能较全面的树，可自由加减树的节点，展示树的各级节点-A function of a more comprehensive tree, free tree node addition and subtraction to demonstrate at all levels of the tree node
search
- 树的遍历（非递归方式实现）：首先按中序方式建立树并输入节点信息，通过栈实现树的非递归方式的先序、中序和后序的遍历-Tree traversal (non-recursive way): First of all, by the way in order to establish the tree and enter the node information, the realization of the tree through the stack of the first non-recurs
include
- 用一个结构体存储每个节点，每个结构体包括一个char 和指向左右孩子的指针，每次扫进来它自身的char和i， 如果i为偶则放进左子树，否则放进右子树。然后就是利用递归前序遍历此树-Structure with a store on each node, each structure includes a char and a pointer to the children about each sweep into its own char and i, for even if i was in
tree
- 简单的java 实现树结构，递归遍历子节点-The realization of a simple tree structure java
mTree
- 快速、小巧、功能强大的树 var tree=new Tree("根节点") var nodei=new TreeNode("节点1") tree.appendChild( nodei ) tree.expandAll() 支持checkbox 一个页面可以有多个树，代码干净 现在在公司的项目中广泛应用-Fast, compact and powerful tree var tree = new Tree ( " root" ) var
oulalujingbianli
- 通过欧拉路径计算非叶子节点的后代数目，并且先序遍历输出构造的二叉树-Eulerian path through the calculation of non-leaf node the number of generations, and output first traversal of the binary tree structure
javascrip-tree
- 一个基于JAVAscr ipt下的树模型结构。支持节点超链接功能。-JAVAscr ipt under a tree-based model structure. Hyperlink function to support the node.
MyTree
- Javascr ipt语言生成的树，可以添加删除节点- a treeview made by javascr ipt which can be deleted and added.
heapsort
- 堆排序算法 一种速度较快的排序算法 构建一棵二叉树，通过调整二叉树的根与叶子节点的关系来完成排序-heap sort class
extjs
- Extjs 树的递归,树的目录和节点的递归组装-Extjs tree of recursive
tree
- 一款在VC++窗体中增加树形菜单的实例，目录树可以无限多个节点，只要你的文件夹有那么多，它就会显示那么多。-A form in VC++ add examples of tree-like menu, directory tree can be an unlimited number of nodes, as long as you have so many folders, it will show so much.
HtmlDomTree
- 用dom树对html文件实现节点信息抽取，分为两部分，定制模板和分析模板-distinguish the html document by dom tree so that draw out the information ,it can divide into two parts ,that is demo tailor and demo analyse.
TreeCommand
- 树的节点之间的分配实例，可以用来同步子节点刷新，选中所有上级节点-Tree distribution of examples between nodes, child nodes can be used to simultaneously refresh, select all the higher level node
Tree
- 由节点生成树，并对生成树的左右子树交换，求节点数及树的高度。-By the node spanning tree, spanning tree and the exchange of left and right subtree, and the number of nodes and tree height.
BiTree
- 强大的二叉树代码大全，前序，中序，后序，叶子结点，入度为1，2的节点的计数-Encyclopedia of powerful binary tree code, the former sequence, in order, after the sequence, the leaf nodes, to the degree of the node counts 1,2, etc.
extTree
- 这是一个ext+dwr的动态树，能自动加载节点-this is a ext+dwr tree example
Create_and_bianli_BiTree
- c语言实现的 算法思想： 根据完全二叉树的定义，对完全二叉树按照从上到下，从左到右的层次序遍历应该满足： （1）某节点没有左孩子，则一定无右孩子 （2）某节点缺左或右孩子，则其所有后继一定无孩子。 若不满足上述任何一条，均不为完全二叉树。 (3) 利用栈先序遍历 -c language implementation of the algorithm is thinking: According to the definition of complete binary
eXtree
- 1. 面向对象，简单易用 2. 每个节点都可以有不同的图标 3. 提供很多有用的方法，满足开发要求 4. 树中的控件（Checkbox, Radio）可以设置成disabled状态 5. 跨平台,可以在支持DOM1的浏览器运行-1. Object-oriented, easy to use 2. Each node can have different icons 3. Provides many useful ways to meet the development
TheBeautyofProgramming_2
- 编程之美--微软技术面试心得: 精确表达浮点数 连连看游戏设计 求二叉树中节点的最大距离 求二进制数中1的个数 寻找发帖“水王” 寻找最大的K个数 饮料供货 中国象棋将帅问题 子数组的最大乘积-Programming of the United States- Microsoft Technical Interview experience: precision floating-point Lianliankan game design to express
Tree
- 实现树的点击 当点击节点时展开子节点树的功能-tree descr iption