搜索资源列表
LinkTree
- 链式存储二叉树，查找左右孩子节点、计算节点数，查找节点，输出节点等。功能齐全，实现简单，没有错误。-Chain store binary tree, find about child nodes, compute nodes, find the node, the output node and so on. Fully functional, simple, no errors.
6-44
- 编写递归算法：求二叉树中以元素值为x的节点为根的子树的深度-Write a recursive algorithm: the value of an element in the binary tree node x is the depth of the subtree rooted
erchashu
- 10个二叉树的基本算法(求宽度、深度、叶子节点、相等、相似等)-10 the basic binary tree algorithm
readXML
- xml文件形成树结构，可以点击打开或者关闭，可以显示节点属性。-xml file to form a tree structure, you can click to open or close, you can display node properties.
TreeViewMultiNodeSelection
- TreeView控件树型多节点选择应用实例,有需有的就下载吧。-Multi-tree node selection TreeView control application example, there are some on the need to download it.
kill
- Linux内核编程，设计某一个函数，输入为Linux系统某一个进程的进程号（PID），函数将杀死该进程的所有子孙。Linux内核进程家族为多叉树数据结构，以祖先进程为根节点。对于这种数据结构，后序遍历树的每个节点，在遍历同时删除节点，就可以删除整个进程树。-Linux kernel programming, design one function, one input for a Linux system process ID (PID), the function will kill all
MCU_SOC_LCD_Menu
- 最近收集的关于菜单的文章,都可以在单片机上实现，比如基于单片机的多级菜单实现方法，基于节点编号的通用树状菜单设计方法与实现等等，真心为网友提供方便，要好评呦，亲-Recently collected articles on the menu, can be implemented on the microcontroller, such as multi-level menu based on single chip implementation method, based on a commo
0c7e75a3-6cd4-3ef4-a568-40fbe7cff264
- zk树的使用方法,自动生成Tree并获取tree节点-zk tree use, automatically generated Tree and get the tree node
decision-tree
- 程序实现了生成决策树并使用决策树对离散特征向量进行分类。在判断是否要继续生成叶节点时采用entropy来作为impurity的measurement.-Program and use the decision tree decision tree to generate discrete feature vectors for classification. In determining whether to continue generating leaf nodes using entrop
ThreeTree
- VC 多选树-三态树，实现了系统中树的不同节点显示不同的状态。-Tree status tree
CHAZHAO
- 1. 实现折半查找算法 2. 建立一棵二叉排序树，输入给定值，在该二叉排序树查找，如不存在该值，则在二叉排序树中插入；如存在该值，则返回节点；实现删除找到节点的算法。 3. 编写测试程序。 -1. Achieve binary search algorithm 2. Establish a binary sort tree, enter a given value, the binary sort tree to find, if the value does not exist,
87654657
- VB目录树，可拖拉、拖放节点,有需要的就下载吧。-VB directory tree, can drag, drag and drop the node that has the need to download it.
4_subTree
- 给定两棵二叉树，求出它们所有节点数大于等于2的最大子树。 二叉树的子树，是指去掉这棵二叉树的某些节点以及与这些节点相连的枝而得到的二叉树。设T为二叉树，R为它的子树，如果不存在二叉树S，使得R为S的子树且S为T的子树，那么称R为T的最大子树。-Given two binary trees, find them all nodes greater than or equal to 2 maximum subtree. A sub binary tree, the binary tree
BiNode
- java实现的二叉树图形演示程序，能够进行添加，删除以及查找父节点等操作。-java implementation of binary graphics demo program that can be added, deleted, and find the parent node and other operations.
avl-1.4.0
- AVL树的C++实现,可以说实现节点建立、添加、删除、树的单旋转与双旋转-implement avl tree in C++
binary-tree
- 二叉树的建立以和先序、中序、后序遍历以及层次遍历，还可以查找并删除节点等-the basic function of binary tree
WorkFlowDemo
- 纯java实现的工作流程编辑器，支持使用拖曳节点定义流程，支持对齐、多选拖放、undo/redo等功能，可以自动按树型排列节点。-Pure java implementation of the workflow editor, support for drag and drop node defines processes to support the alignment, multiple choice and drop, undo/redo functions, can automatica
binary_tree
- 二叉树的编程，包括建立，插入节点、遍历等-Binary tree of programming, including creating, traversal, etc., can run out of the results
tree
- 树的相关操作，先序遍历建立二叉链表，左右孩子交换，二叉树中叶子节点个数算法，统计以值为x的结点为根的子树中叶子结点的数目，按树状打印二叉树-Tree-related operations, first traversal establishment of binary list, so the child exchange, the number of leaf nodes in a binary tree algorithm, the statistical value of x to a n
vs2008-CPP-Package
- 实现树控件，并判断节点是否被点击，并把点击的内容显示在右边新建的视图窗口里-Realize the tree control, and to determine whether a node by clicking, and click on the content of the show in the new view window on the right