Location:
Search - two-three-tree
Search list
Description: 二维树，实现一个三维的树林空间，优点可以减小程序的体积。能实现三维的效果，它把二维树的正面始终对着视点，从而可见的总是一棵树，而不会出现失真-two-dimensional tree, to achieve a three-dimensional space woods advantage of the procedure can reduce the volume. To achieve the 3-D effect, two-dimensional tree always facing the positive perspective, always a visible tree, with no distortion
Platform: |
Size: 34579 |
Author: 丁钱飞 |
Hits:
Description: 二维树，实现一个三维的树林空间，优点可以减小程序的体积。能实现三维的效果，它把二维树的正面始终对着视点，从而可见的总是一棵树，而不会出现失真-two-dimensional tree, to achieve a three-dimensional space woods advantage of the procedure can reduce the volume. To achieve the 3-D effect, two-dimensional tree always facing the positive perspective, always a visible tree, with no distortion
Platform: |
Size: 34816 |
Author: 丁钱飞 |
Hits:
Description: 对偶复树小波以及去噪，
包含1维二维三维的程序实现-Dual tree complex wavelet and the noise, including the one-dimensional two-dimensional three-dimensional program
Platform: |
Size: 1821696 |
Author: li |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: |
Size: 17408 |
Author: 游弋人生 |
Hits:
Description: 多元树的层次遍历、先根遍历、后根遍历
问题的描述：
函数填空：层次遍历多元树（在文件tree.cpp中3个空）、先根遍历、后根遍历的递归函数（在文件tree.h中2个空）；
多元树的输入：在主程序中调用多元树的函数（定位根、找大儿子、找下一个兄弟等），输入某棵多元树。
-Multi-level tree traversal, the first traversal the root, root traversal issues Description: function to fill in the blank: multi-level tree traversal (tree.cpp in the document in three space), the first traversal the root, root ergodic recursive function (in the document in two empty tree.h) multiple input tree: In the main program to call multi-tree function (positioning root, look for the eldest son, to find a brother, etc.), enter a multi-tree tree.
Platform: |
Size: 3072 |
Author: YY |
Hits:
Description: 本实验由以下环节组成：
1） 存储结构
以二叉链表或三叉链表作为二叉树的存储结构；
2） 二叉树的创建(链式存储)
以某一种遍历的次序录入二叉树的元素，写出相应的二/三叉链表的创建算法，并上机实现该算法；
-In this study, composed of the following aspects: 1) The storage structure to two or three-pronged fork linked list is stored as a binary tree structure 2) the creation of a binary tree (chain store) to a particular traversal order of entry binary elements, write the corresponding two/three-pronged list creation algorithm and the algorithm on the machine
Platform: |
Size: 4096 |
Author: wanglin |
Hits:
Description: 直接运行compile.bat和run.bat即可
使用了3种分词方法：
1.正向最大匹配(ForwardMatch.java)
2.逆向最大匹配(ForwardMatch.java)
3.最大频率匹配(FrequencyMatch.java)(默认)
取频率最高的词，然后两端递归，构建二杈树存储句子中的词语，显示的时候使用中序遍历二杈树
由于极有可能单个字的使用频率比整个词还高，筛选的时候进行了处理
若单个字不处于当前句子开头，先忽略，
若单个的字处在开头，临时mostFrequency仍为0，且单词长度为1，则加入到二杈树中-Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree
Platform: |
Size: 1253376 |
Author: 吴浩 |
Hits:
Description: 56UYE54Y6 RGSEGESRF ribe it at least 40 bytes in English.
System will automatically delete the directory of debug and release, so please do not put files on these two
Platform: |
Size: 39936 |
Author: sajjad |
Hits:
Description: 2-3 树插入，查找，删除，排序，从文件txt读入插入，查找，删除，排序等指令-two three tree, including insert, search,order,delete, you can read command for txt file
Platform: |
Size: 5120 |
Author: hazel |
Hits:
Description: 对偶复树小波以及去噪， 包含1维二维三维的程序实现-Dual tree complex wavelet and the noise, including the one-dimensional two-dimensional three-dimensional program -The dual tree complex wavelet and denoising, including 1-dimensional 2D and 3D programs to achieve-Dual tree complex wavelet and the noise, including the one-dimensional two-dimensional three-dimensional program
Platform: |
Size: 1821696 |
Author: gaoyuan |
Hits:
Description: n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements-n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements
Platform: |
Size: 15360 |
Author: aa |
Hits:
Description: 假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。 试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。-In the following description of the three tuple hypothesis ( F, C, L/R ) sequence input a two fork tree plurilateral ( wherein F represents the parent node ID, C said the child node ID, said L/R C F children left or right child ), and in the three input tuple sequence, C is based on the layer order. A node identifier is the type of character. F= C ^ is the root node ID, if C is also a ^ , said the end of input. try to write algorithm, from the input of the three tuple sequence to establish a binary tree of two two binary list, and to the sequence in the sequence output.
Platform: |
Size: 153600 |
Author: shiloh |
Hits:
Description: 二叉树问题
1、 按根、左子树和右子树三部分进行遍历
遍历二叉树的顺序存在下面6种可能：
TLR（根左右）, TRL（根右左）
LTR（左根右）, RTL（右根左）
LRT（左右根）, RLT（右左根）
其中，TRL、RTL和RLT三种顺序在左右子树之间均是先右子树后左子树，这与人们先左后右
的习惯不同，因此，往往不予采用。余下的三种顺序TLR、LTR和LRT根据根访问的位置不同分别
被称为先序遍历、中序遍历和后序遍历。
（1）先序遍历
若二叉树为空，则结束遍历操作；否则
访问根结点；
先序遍历左子树；
先序遍历右子树。
（2）中序遍历若二叉树为空，则结束遍历操作；否则
中序遍历左子树；
访问根结点；
中序遍历右子树。
（3）后序遍历
若二叉树为空，则结束遍历操作；否则
后序遍历左子树；
后序遍历右子树；
访问根结点。-1, according to the root, the left subtree and the right subtree traversal three partTraverse the two fork tree sequence there are 6 possible:TLR ( or so ), TRL ( root of right and left )LTR ( left radical right ), RTL ( right to left )LRT ( or root ), RLT ( right left root )Among them, TRL, RTL and RLT three kinds of sequence in the left and right subtree are to the right subtree after left subtree, and the first leftDifferent habits, therefore, are often not used. The remaining three order of TLR, LTR and LRT respectively according to root access locationKnown as the first traversal, preorder and postorder traversal.( 1) the first traversalIf the two fork tree is empty, then the end of traversal operation otherwiseAccess to the root node Preorder left subtree Preorder right subtree.( 2) in the traversal binary tree is empty if two, then the end of traversal operation otherwiseTraversal of the left subtree Access to the root node Traversal of the right subtree.( 3) after the travers
Platform: |
Size: 1024 |
Author: 周杨 |
Hits:
Description: 2—3树是这样一种树：
A．每个非叶子结点都有2个或3个儿子；
B．每条众树根到树叶的路径长度相等；
C．只有一个根结点的树也是2—3树。
本题目要求从键盘输入以整数序列，建立一棵2-3树。所以我的建树构思为以2-3树的插入操作来进行建树。-2-3 tree is such a tree: A. Each non-leaf node has two or three sons B. Each congregation tree roots to leaves is equal to the length of the path C. 2-3 tree is only one root node of the tree. The subject of the request to establish a 2-3 tree from keyboard input to a sequence of integers. So I conceived the achievements of the achievements of 2-3 tree insertion operation.
Platform: |
Size: 2048 |
Author: 冯读庆 |
Hits:
Description: 实现排序二叉树三种遍历的代码。刚开始学习C程序，故有些水，这是我关于树类应用的处女作，望大家勿喷-Sorted binary tree three traversal code. Just started learning C program, some water, this is my debut on tree type applications, we hope not to spray Thank ...
Platform: |
Size: 1024 |
Author: xulining |
Hits:
Description: 复杂的3 d双树离散小波变换(DWT)同样也引起了小波的两倍作为真正的3 d双树离散小波变换(DWT)。这两个小波在每一个方向,可以解释为真实的和虚构的部分一个复数的3 d小波。复杂的3 d双树被实现为八严格采样可分3 d DWTs操作在并行。然而,不同的过滤器集用于每个三个维度。
-3 d complex- Doubletree discrete wavelet transform (DWT) also caused the wavelet twice as a real 3 d Doubletree discrete wavelet transform (DWT). Two wavelet in each direction, can be interpreted as the real and imaginary part of a complex 3 d wavelet. The complicated 3 d Doubletree is implemented as eight rigorous sampling can be divided into 3 d DWTs operating in parallel. However, a different set of filters for each of the three dimensions.
Platform: |
Size: 1024 |
Author: 陈静 |
Hits:
Description: 实现可扩展的listview，可以实现两级至三级的树状列表的显示-Scalable listview, can achieve two to three tree list display
Platform: |
Size: 65536 |
Author: 陈伟 |
Hits:
Description: android 实现树形结构的列表，可以添加二级、三级或更多级的节点-android tree structure to achieve a list, you can add two, three or more levels of nodes
Platform: |
Size: 34816 |
Author: mush |
Hits:
Description: 超使用简单的二级树形下拉及三级树形下拉，初学者学习的好代码-Super simple two and three tree tree drop down , beginners learn the code
Platform: |
Size: 62464 |
Author: 唐川 |
Hits:
Description: 关于二叉树先、中、后三种遍历的算法，以及对两棵二叉树进行判等的算法用c语言加以实现-About binary tree first, middle and last three traversal algorithms, and sentenced to two trees and other binary tree algorithm to be implemented in c language
Platform: |
Size: 3072 |
Author: |
Hits: