Location:
Search - binary tree
Search list
Description: 是其中之五,两分树-is Five, two points tree
Platform: |
Size: 7168 |
Author: weng |
Hits:
Description: ADT BinaryTree 的实现及验证程序采用的主要数据结构：二叉树、栈、队算法思想：1、 先序建树、输出树、后序遍历用递归方法。性能分析：O( n )2、 先序遍历、中序遍历：性能分析：O( n )(1) 若遇到新节点非空则先入栈，然后访问其左子树。(2) 若为空则将栈顶结点出栈，访问其右子树。(3) 循环1、2直到栈为空且无节点可入栈。先序与中序的区别是：先序在入栈时访问节点，中序在出栈时访问节点。3、 层遍历：性能分析：O( n )(1) 根节点入队(2) 节点出队并访问(3) 若节点有左孩子，则左孩子入队；有右孩子，则右孩子入队。(4) 重复2、3直到队列为空。4、 线索树：算法与先序遍历、中序遍历一样，只是将访问节点的Visit函数改为连接前驱与后继的操作。性能分析：O( -BinaryTree ADT Implementation and certification procedures used in the main data structure : binary tree, stack, algorithms team thinking : a first order contribution, the output tree, after preorder using recursive method. Performance Analysis : O (n) 2, preorder, the preorder : Performance Analysis : O (n) (1) If there is a new non-empty nodes were first pushed and then left to visit their son tree. (2) if the empty Zhanding node will stack up, visit their right subtrees. (3) 1,2 cycle until the stack is empty with no node can be pushed. First sequence with the sequence difference : Push the first sequence to visit nodes, which stack up in order to visit nodes. 3, the layer traverse : Performance Analysis : O (n) (1) nodes into Force (2) nodes and the team's visit (3) if the nodes ar
Platform: |
Size: 2048 |
Author: 徐欣 |
Hits:
Description: Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。-Addison-Velski and Landis (AVL- Tree s) of the binary tree, the right time for a few of the standard operation, such as insert, delete and search.
Platform: |
Size: 969728 |
Author: 倪玲 |
Hits:
Description: This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
Platform: |
Size: 3072 |
Author: 冰冰 |
Hits:
Description: 将视图分割成两部分，左边为显示取，右边为数据录入区，每录入一个节点数据，立即在左边显示节点图形，能实现二叉树的插入、删除、前序遍历、中序遍历、后序遍历。-View will be divided into two parts, shown from left to right for the data entry areas, each node a data entry immediately on the left shows nodes graphics can achieve binary tree insertion, deletion, the former preorder, preorder, after preorder.
Platform: |
Size: 60416 |
Author: 编程浪子 |
Hits:
Description: 数据结构，关于二叉树建立的方法例子，希望对大家有用处-data structure, the establishment of the binary tree example, we hope to be useful
Platform: |
Size: 87040 |
Author: 黑雨 |
Hits:
Description: 二叉树的4个非递归算法,中序先序后序和层次遍历,算法都有注释而且很详细,适合数据结构学习者使用-binary tree four non- recursive algorithm, the first sequence after sequence and the sequence level traversal algorithm Notes but have very detailed data structure suitable for use Learners
Platform: |
Size: 337920 |
Author: 赵麟 |
Hits:
Description: 二叉排序树的查找算法，用非递归做的，查找删除节点等操作-Binary Tree Search ranking algorithm, the use of non- recursive so that you delete nodes, etc
Platform: |
Size: 163840 |
Author: 苗建新 |
Hits:
Description: 实现数据的压缩，演示Huffman二叉树的应用。虽然压缩效果不如rar等，但是作为一种算法，具有可借鉴的价值。-data compression, presentations Huffman binary tree applications. Although not rar compression, but as an algorithm that can draw is the value.
Platform: |
Size: 6144 |
Author: 祝桦岸 |
Hits:
Description: 二叉树的一般操作:
1. 判断二叉树是否为空。
2. 搜索二叉树中的某一项。
3. 在二叉树中插入一项。
4. 从二叉树中删除一项。
5. 求二叉树的高度。
6. 求二叉树的节点数量。
7. 求二叉树的叶节点数量。
8. 遍历二叉树。
9. 复制二叉树。
-binary tree : 1. To judge whether the binary tree is empty. 2. Binary Tree Search of a one. 3. The insertion of a binary tree. 4. From a binary tree removed. 5. For binary tree height. 6. For binary tree node number. 7. For binary tree leaf node number. 8. Traverse binary tree. 9. Replication binary tree.
Platform: |
Size: 109568 |
Author: 刘炎黄 |
Hits:
Description: 对读入的某个文本文件input.txt中，拆出英文单词，输出一个按字典顺序排列的单词表，结果输出在文本文件output.txt中，每个单词一行，并在单词后输出该单词出现的个数，两个字段之间用逗号分隔。约定单词仅由英文字母组成，单词间由非英文字母分隔，相同单词只输出一个，大小写不区分。
利用二叉树实现-the right time to a text file input.txt, divestment English words, Output by an order of the dictionary word list, the result output in a text file output.txt. Every word here, and the output of the word after word of the number, between two fields separated by a comma. Agreed only by the words in alphabetical composition, word by non-alphabetic segregation, the same word is only one output, distinction is not case. Achieved using binary tree
Platform: |
Size: 40960 |
Author: 李剑 |
Hits:
Description: 中序遍历输出二叉树
输出二叉树的叶子树
输出二叉树的节点数-which preorder output binary tree output binary tree leaf tree output binary tree nodes
Platform: |
Size: 280576 |
Author: 刘黎 |
Hits:
Description: 几篇关于游戏场景管理的方法介绍，其中包括二叉树、BSP树的详细内容。-few scenes management of the game on the way, including the binary tree, the BSP tree in detail.
Platform: |
Size: 457728 |
Author: weiguian |
Hits:
Description: 数据结构
1、算法思路：
在此二叉树操作中，主要采用链式存储结构，由于遍历二叉树基本操作是访问结点，则不论按哪一种次序进行遍历，对含有n个结点的二叉树，其时间复杂度均为O(n)；空间复杂度为二叉树的高度。
-Data Structure 1, Algorithm idea: In this binary tree operation, mainly the structure of chain stores, due to the basic operation is a binary tree traversal to visit nodes, regardless of by what kind of order traversal, containing n- node of the tree, its time complexity are O (n) space complexity for the tree height.
Platform: |
Size: 29696 |
Author: Anson |
Hits:
Description: c语言描述的数据结构，二叉树的数据结构的抽象数据类型-c language to describe the data structure, binary tree data structure of the abstract data types
Platform: |
Size: 2048 |
Author: 猫 |
Hits:
Description: This program creates a binary Search Tree, traverse it in pre, post and inorder and also create the mirror image of the binary tree.
Platform: |
Size: 1024 |
Author: Raj |
Hits:
Description: 这是个有关C语言二叉排序树的简单小小小小程序 -This is a small c language program about binary tree
Platform: |
Size: 1024 |
Author: heihei |
Hits:
Description: 【二叉树遍历的递归算法实现】
操作：根据提示输入相应数据实现各种功能
函数：菜单函数(menu)
前序建立二叉树(Crt_BinTree)
访问结点(Visit)
前序遍历(Pretraverse)
中序遍历(Intraverse)
后序遍历(Suctraverse)
删除树(Destory)
操作函数(perform)Pretraverse
主函数(main)
说明：结点数据初始为char型，但可在前面代码部分修改
成其他类型，输入时@代表子树为空-The binary tree traversal of recursion algorithm 】
Operation: according to the prompt corresponding input data realization of different functions
Function: the menu function (menu)
The preface to establish a binary tree (Crt_BinTree)
Access nodes (Visit)
The preface to traverse (Pretraverse)
In order to traverse (Intraverse)
After traverse sequence (Suctraverse)
Delete tree (Destory)
Operation function (perform) Pretraverse
The main () function (main)
Note: data for type char initial nodes, but can be in front the code changes
Into other types, input on behalf of children for empty @ tree
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 平衡二叉树源代码
二叉树的格式化输出
可执行文件(Balanced two fork tree source code
Two tree formatted output)
Platform: |
Size: 119808 |
Author: 乌鸦坐飞机
|
Hits:
Description: Binary Tree / Can insert word or number
Platform: |
Size: 1136640 |
Author: YYSSHH
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»