Description: 这个程序时avl树的所有算法的实现,包括插入删除新建排序,是数据结构学习者的极佳材料,VC实现-this procedure when all the AVL tree algorithm implementation, including delete, insert new sequencing, data structure is a very good learner materials, VC Platform: |
Size: 99272 |
Author:陈万通 |
Hits:
Description: 演示了AVL的删除与插入算法，通过模拟dos命令行实现。-demonstration of the AVL delete and insert algorithm simulation dos command line to achieve. Platform: |
Size: 19628 |
Author:byron |
Hits:
Description: Spell-Checker
This program is implements by using AVL Tree algorithms. Its mainly implement by five functions which include AVL_insert, AVL_remove, AVL_destroy, AVL_findNearest, and AVL_print.
The algorithm for the function of AVL_insert and AVL_remove, actually similar to the ALV Tree insert and delete algorithm that we have learn from our lecture notes.
The function of AVL_destroy actually destroys all the nodes by scanning the whole ALV tree once.
The algorithm for function of AVL_findNearest is scanning the element by using the BST algorithm and moves the pointer s1 if it scanning to the right element, or moves the pointer s2 if it scanning to the left element. Then if the function found the element, the program will return the address of the element in the tree, otherwise s1 and s2 will pointing to the elements which is just smaller and lager to the element.
And the function of AVL_print, actually just scanning the whole AVL tree by printing from left to nodes to right. Platform: |
Size: 256873 |
Author:chan kindfish |
Hits:
Description: 这个程序时avl树的所有算法的实现,包括插入删除新建排序,是数据结构学习者的极佳材料,VC实现-this procedure when all the AVL tree algorithm implementation, including delete, insert new sequencing, data structure is a very good learner materials, VC Platform: |
Size: 99328 |
Author:陈万通 |
Hits:
Description: 演示了AVL的删除与插入算法，通过模拟dos命令行实现。-demonstration of the AVL delete and insert algorithm simulation dos command line to achieve. Platform: |
Size: 19456 |
Author:byron |
Hits:
Description: AVL树的定义,包括初始化,插入,删除,采用的标准的算法,语言清晰,AVL树是一种效率比较高的平衡二叉树.-Definition of AVL trees, including the initialization, insert, delete, using the standard algorithm, the language clear, AVL tree is a relatively high efficiency of the balanced binary tree. Platform: |
Size: 26624 |
Author:胡博 |
Hits:
Description: 经典数据结构算法实现
平衡二叉树的建立和维护-Classical data structure binary tree algorithm to achieve a balance of the establishment and maintenance of Platform: |
Size: 278528 |
Author:nido |
Hits:
Description: Spell-Checker
This program is implements by using AVL Tree algorithms. Its mainly implement by five functions which include AVL_insert, AVL_remove, AVL_destroy, AVL_findNearest, and AVL_print.
The algorithm for the function of AVL_insert and AVL_remove, actually similar to the ALV Tree insert and delete algorithm that we have learn from our lecture notes.
The function of AVL_destroy actually destroys all the nodes by scanning the whole ALV tree once.
The algorithm for function of AVL_findNearest is scanning the element by using the BST algorithm and moves the pointer s1 if it scanning to the right element, or moves the pointer s2 if it scanning to the left element. Then if the function found the element, the program will return the address of the element in the tree, otherwise s1 and s2 will pointing to the elements which is just smaller and lager to the element.
And the function of AVL_print, actually just scanning the whole AVL tree by printing from left to nodes to right. -Spell-Checker This program is implements by using AVL Tree algorithms. Its mainly implement by five functions which include AVL_insert, AVL_remove, AVL_destroy, AVL_findNearest, and AVL_print. The algorithm for the function of AVL_insert and AVL_remove, actually similar to the ALV Tree insert and delete algorithm that we have learn from our lecture notes. The function of AVL_destroy actually destroys all the nodes by scanning the whole ALV tree once. The algorithm for function of AVL_findNearest is scanning the element by using the BST algorithm and moves the pointer s1 if it scanning to the right element, or moves the pointer s2 if it scanning to the left element. Then if the function found the element, the program will return the address of the element in the tree, otherwise s1 and s2 will pointing to the elements which is just smaller and lager to the element.And the function of AVL_print, actually just scanning the whole AVL tree by printing from left to nodes to right. Platform: |
Size: 257024 |
Author:chan kindfish |
Hits:
Description: 此文件夹中共包括十二个小程序
AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除
Boyer_Moore算法的串模式匹配
Horspool算法的串模式匹配
Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历
HeapSort利用堆排序实现优先级队列
Merge实现二路归并排序算法
MFK动态规划解背包问题
nqueue求解n皇后问题
QuickSort快速排序算法的实现。
Shell排序算法的实现。
Tree程序中实现了先序\中序\后序遍历二叉树的非递归算法。
tubao用递归法解决突包问题-This folder, including the Chinese Communist AVL applet 12 to create a balanced binary tree, by adding a node to create, and achieving a balanced binary tree of nodes to delete Boyer_Moore algorithm Horspool string pattern matching the string pattern-matching algorithm Graph to achieve a directed graph breadth-first traversal non-recursive and non-recursive depth-first traversal HEAPSORT HeapSort use to achieve the realization of priority queue Merge merge sorting algorithm Road MFK knapsack problem dynamic programming solution of n queen problem solving nqueue rapid QuickSort sort algorithm. Shell Sort Algorithm. Tree process sequence to achieve the first \ in the sequence \ after the sequence of the non-recursive binary tree traversal algorithm. tubao recursive method used to solve the issue of sudden package Platform: |
Size: 374784 |
Author:zouyan |
Hits:
Description: 次代码是实现平衡二叉树的数据结构算法。参考的是严蔚敏c和c++数据结构书上的思想。经过调试可以连续实现删除、插入、查找算法-Sub-code is to achieve a balanced binary tree data structure algorithms. Reference is Yan Wei-Min c and c++ data structure book ideas. Debugging can be achieved through a continuous delete, insert, search algorithm Platform: |
Size: 8192 |
Author:liuhua |
Hits:
Description: 1:折半查找算法的思想及实现。
2:掌握二叉排序树，AVL树的查找，插入，删除，建立算法的思想及实现
3：存储结构的思想，能选择合适散列函数，实现不同冲突处理方法的散列表的查找，建立
-1: The binary search algorithm and the realization of the idea. 2: The master binary sort tree, AVL tree search, insert, delete, create the idea of the algorithm and implementation of 3: storage structure ideas, to choose a suitable hash function, conflict management methods to achieve different hash table lookup, the establishment of Platform: |
Size: 84992 |
Author:王博 |
Hits:
Description: 问题描述：设计一个英汉词典，支持Member的查找、插入、删除操作。
基本要求：实现字典的常用方法有：有序线性表（用二分检索实现）、AVL树（二叉搜索树）、Patricia Tree、散列表等，任选一种方法实现字典的操作，查找单词、插入单词（插入时，先查找，找不到插入，找到提示用户）、删除单词（删除时，先查找，找到删除，找不到提示用户）。字典是按字母顺序排列的，不能用顺序查找，插入或删除单词后，要保持字典的有序性。
测试数据：任一英文单词。
提高要求：选用两种以上的方法实现字典的操作，要比较不同实现算法的时间复杂度和空间复杂度。
-Problem Description: design an English-Chinese dictionary, support Member search, insert, delete operation.Basic requirements: to achieve the dictionary usually used methods are: linear table ( with two points and retrieval ), AVL tree ( binary search tree ), Patricia Tree, hash table, choose one method to realize the operation of finding words, dictionary, insert the word ( when inserted, to find, to find insert, find tips user ), delete ( delete words, first search, find the delete, find prompting the user). The dictionary is arranged in alphabetical order, not a sequential search, insert or delete a word, to maintain the order of the dictionary.Test data: any English words.Improve requirements: selection of more than two kinds of method to realize the operation of the dictionary, to compare different algorithm time complexity and space complexity. Platform: |
Size: 1024 |
Author:姚伦帮 |
Hits:
Description: 这个程序时avl树的所有算法的实现,包括插入删除新建排序,是数据结构学习者的极佳材料-Avl tree all the algorithm when the program implementation, including delete insert new sorting, excellent material learners is a data structure Platform: |
Size: 78848 |
Author:bkamke |
Hits:
Description: 这个程序时avl树的所有算法的实现,包括插入删除新建排序,是数据结构学习者的极佳材料-Avl tree all the algorithm when the program implementation, including delete insert new sorting, excellent material learners is a data structure Platform: |
Size: 97280 |
Author:Mycapq |
Hits:
Description: 这个程序时avl树的所有算法的实现,包括插入删除新建排序,是数据结构学习者的极佳材料(Avl tree all the algorithm when the program implementation, including delete insert new sorting, excellent material learners is a data structure) Platform: |
Size: 77824 |
Author:schemam
|
Hits:
Search - avl delete algorithm