搜索资源列表
node_contract
- 类似于二叉树,自由扩展节点,通过自行搜索算法增加节点-Similar to the two fork tree, free extension node, the search algorithm
node_contract
- 类似于二叉树,自由扩展节点,通过搜索算法计算下级节点 -Similar to the tree, expand the node freedom, the search algorithm to calculate the lower nodes
PrintTreeLikeTree
- 在控制台树形输出二叉树,使用了队列。首先设置叶子节点间的间距,然后以坐标的形似记录下每个节点的位置-Binary output in the console tree, using a queue. The spacing between the first set of leaf nodes, then the coordinates of the shape of the recording position of each node
main
- 二叉链表的建立,前中后序遍历(递归、非递归),层次遍历,删除子树,查找节点,求树的高度,以括号法输出二叉树-Build the binary tree, the former after preorder (recursive, non-recursive), hierarchical traversal, delete sub-tree to find the node, find the height of the tree, binary output in brackets law
ctree
- 平衡二叉树生成 输入任意个节点 如 2 6 8 0为显示 可自动生成平衡二叉树 bf为平衡因子 h给深度 可插入删除 计算转动次数-Balanced binary tree to generate arbitrary input nodes as 2680 to show a balanced binary tree can be automatically generated for the balance factor bf depth h to calculate the number o
BinaryTree
- 二叉树类的全部实现:建树、清空、判空、找根节点、找父节点、找子节点、剪枝、前序遍历、中序遍历、后序遍历和层次遍历、判断是否为完全二叉树。-All binary tree class: achievements, empty, empty sentence, find the root node, find the parent node, find the child nodes, pruning, preorder, preorder, postorder traversal and leve
Huffman-algorithm-code
- 哈夫曼树是一种树形结构,用哈夫曼树的方法解编程题的算法就叫做哈夫曼算法。树并不是指植物,而是一种数据结构,因为其存放方式颇有点象一棵树有树叉因而称为树。 最简哈夫曼树是由德国数学家冯。哈夫曼 发现的,此树的特点就是引出的路程最短。 概念理解:1.路径 从树中一个节点到另一个节点之间的分支构成这两个节点之间的路径。2.路径长度 路径上的分支数目称作路径长度。-Huffman tree is a tree structure, Huffman tree algorithm method to sol
BPTree
- 1、枝干节点的关键字在每个叶子节点的最后一个 2、叶子节点中的Vals不是值集合,而是值指针集合,主要是减少移动时的拷贝时间 本来也想Keys也做也指针集合,但是会有一个问题,如果当做数据库的索引,它就必需调阅多个页 当然Keys是值集合也会有问题,对于字符串来作Key就会有对象拷贝的问题 因此我觉得要实现两种B+树,一种是值集合的,一种是值指针集合的, 对此有兴趣的朋友可以共同探讨,发邮件至 xtlxs1976@163.com
TreeListViewDemo
- 可以在安卓系统打印出树的层次结构,采用的是java的泛型编程,只需自己写节点类型和xml文件就可以实现自己的树。-You can print out the Android hierarchy tree, using generic programming java, just write your own node types and xml file you can implement your own tree.
test
- 输入一棵二元查找树,将该二元查找树转换成一个排序的双向链表。要求不能创建任何新的结点,只调整指针的指向使原节点按升序排列-Enter a binary search tree, the binary search tree into a sort of doubly linked list. Request can not create any new nodes, only adjust the pointer points to make the original ascending nod
dragtree
- 可拖动树修改,增加同一节点下兄弟节点之间拖动排序-You can drag the tree to modify, add and drag the nodes under the same sort between siblings
main
- 包括avl树的建立插入和删除操作,对单个节点的操作-Including the establishment of insert and delete operations avl tree on a single node operation
cumulate
- 多层次关联规则挖掘算法:cumulate 可以支持跨层的关联规则挖掘。数据集为T10I4D100K,概念层次树有10个根节点,分三层。-Multi-level association rule mining algorithm: cumulate to support cross-layer association rule mining. Dataset T10I4D100K, has 10 concept hierarchy tree root, divided into three lay
BRTreeTest
- 关于二叉树的例子编写。包括构建二叉树,节点的删除,添加,修改节点数据内容,二分搜索查找等使用功能-a tool to learn binary tree
BiTree
- a.能够先序输入一颗二叉树。 b.能够实现对此二叉树进行 先序、中序、后序遍历; c.统计树中叶子节点个数; d.对二叉树进行 先序、中序、后序线索化; e.对线索化后的树进行 先序、中序、后序遍历; f.显示该树。 -a. could preorder enter a binary tree. b able to achieve this binary tree preorder, inorder, postorder . number of leaf nodes c
binary-tree
- 二叉树的基本算法代码,包括插入节点、删除节点、遍历二叉树等基本算法。-Binary basic algorithm code, including insert nodes, delete nodes, and other basic binary tree traversal algorithm.
binary_tree
- 二叉树的一些基本操作,建立,删除,增加删除节点,-Some of the basic operations of a binary tree, create, delete, delete nodes increases,
JugeTree
- 这是一个数据结构二叉树遍历的应用。通过遍历二叉树的节点,最终做出性格测试。-This is a binary tree data structure traversal applications. By traversing the binary tree node, and ultimately make the personality test.
CPP-multi-tree
- 模拟随机的多叉树的实现,可以实现增加节点、组合节点、打印节点、节点数目查询等功能。-Stochastic simulation of multi-tree, you can add nodes to achieve a combination node, print nodes, number of nodes query.
bTree
- 二叉树问题,二叉树创建以及拷贝,节点的交换-Btree create and swap, so on