搜索资源列表
BSTree
- 从键盘上输 入一串正整数, 最后输入-1作为输入结束的标志。以这些正整数的值作为二叉排序树中的结点的数据场之值,建立一棵二叉排序树要实现排序二叉树的插入。采取叶子插入法,即新插入的节点均为改二叉树的叶子节点,且满足中序有序性。-From the keyboard to enter a string of positive integers, the last input-1 as the input end of the sign. These are integer values as bin
tree_two
- 二叉树操作实例,包括 1 建立二叉树 2 先序非递归遍历 3 中序递归遍历 4 后序递归遍历,求叶节点数 5 删除节点 6 结束程序运行 等操作。输入数字1~6,选择以上6种操作。-Examples of binary operations, including the establishment of a binary tree two first order non-recursive inorder traversal three recursive postorder traversal
same_acient
- 比较简练的一个寻找一个二叉树的两个节点的最近祖先结点的方法,通过数组的操作不仅快速而且代码量小,易懂。-Looking for a concise comparison of the two nodes in a binary tree node the most recent ancestor of the method, through the operation of the array is not only fast but also the amount of code is sma
123
- 树状结构的现实,可增加节点,删除。与数据库相连。-The tree structure of reality, can increase the node, delete the. Connected with the database.
Huffman1
- 哈弗曼编码 C++编程 哈弗曼树的建立,编码储存,哈弗曼树的现实 左右孩子节点现实-Huffman
tree
- 二叉树的实现 孩子兄弟节点法完成二叉树的各种遍历操作 课程设计-Binary tree node method to achieve complete binary brothers kids of various traversal operation of curriculum design
tree
- 确定二叉树的特征。如:每个节点的层次,从根到该节点的枝长(路径长度),子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-To determine the characteristics of a binary tree. Such as: the level of each node from the root to the node branch length (path length), the number of children and grandchildren an
yufashu-Node
- 写一个编译器必须建立语法树,以下是建立语法树时时所用的基本节点。-To write a compiler syntax tree must be established, the following is a syntax tree from time to time used to establish the basic nodes.
NoteBook
- 自己做的一个记事本界面,左边具有树结构,可以实现增删改节点。想要的朋友可以看看。-NoteBook Interface,it is useful to somebody.
TreeFile
- 在树型控件中每一个节点都有一个句柄,利用函数InsertItem实现节点的添加功能。-In the tree control, each node has a handle, using the function InsertItem add functionality to achieve the node.
java_tree
- 自己开发的可扩展java树结构,包括节点排序,遍历(非递归算法),查找(单节点,全路径匹配),添加删除等。排序方式,节点匹配方式均可通过接口可扩展,本代码是自己开发的一个cms项目中的一部分,可独立使用-Self-developed scalable java tree structure, including nodes sorting, traversal (non-recursive algorithm), find (single node, the full path to match
extjsTree
- js实现的树,具有自动添加节点的功能。操作方便、实用等特点。样式也比较美观-js to achieve a tree, with automatically add the node function. Easy to operate, practical and so on. Styles also more attractive
AVL_BST
- 完整实现BST与AVLtree的功能 包括树的一节一节点的建立与一点一点的的删除-Binary search tree and AVL tree
huffman_hjd
- 哈夫曼编码,给出节点的权值,建立一颗哈夫曼树-Huffman coding, given the weight of the node, the establishment of a Huffman tree
binarytree
- 二叉树的基本功能:1.生成一棵以二叉链表存储的二叉树bt (节点树可自定义)2.用递归方法前序、中序、后序遍历bt,并以缩格形式打印bt上各结点的信息3.交换bt上的所有左右子树,并以缩格形式打印出交换前后的bt结点信息-binary trees
TreeView
- TreeView 控件 TreeView 控件用来显示目录树结构分级视图,如同 Windows中显示的文件和目录。TreeView 控件中的各项信息都有一个与之相关联的Node对象。每个 Node 对象均由一个 Label 对象和其相关的位图组成。建立TreeView 控件后,我们可以展开和折叠、访问其中的节点。 要在 TreeView 控件中使用图标,必须通过 ImageList 控件并用代码与其关联起来,方法是设置 TreeView 控件ImageImageL
Vs2005_for_TreeView
- 一个简版的继承自TreeView的控件,实现树型结构的增加同级下方节点。-A simple version of the inherited from the TreeView control to achieve an increase in tree structure below the node at the same level.
classify
- 改程序可实现对一个树状结构的判断,包括多父节点、子节点等的判断-Reform program can achieve a tree structure of the judgments, including multi-parent node, child nodes, etc. to determine
huffman
- 一个用哈夫曼树实现的家谱程序,可以查找儿子,父亲节点以及这个家族的代数等。-Huffman tree implemented using a genealogy program, you can find her son, the father node, and the family algebra, etc.
dojo_tree
- 一款自己实现的dojo树,可实现多级,用户自定义对节点进行管理-A realization of their own dojo tree, can be multi-level, user-defined managed nodes