搜索资源列表
Multi-functionmeun
- lcd12864多级菜单的文档,使用树状结构实现多级菜单的编写。-Multi-function meun
CoSaMP-and-wavelet-tree-model
- 计算机应用研究 基于小波树模型的CoSaMP压缩感知算法 苏维均-Application Research of Computers CoSaMP algorithm of compressed sensing based on wavelet tree model SU Wei-jun
VCPP-huffman
- VC++ 霍夫曼树算法压缩与解压txt文本文件-vc++ huffmancode
ZedBoard-step4
- ZedBoard学习手记(四)为使用Linux系统做准备——建立Bootloader及设备树-ZedBoard Learning Notes (d) to prepare for the use of Linux systems- Bootloader and equipment to build the tree
shiyan3
- 对四则运算表达式的抽象语法树进行后序遍历,可以得到输入表达式所对应的四元式序列(实验4要用到这样的四元式序列)。例如输入1+2*(3+4),对应的抽象语法树的中序遍历序列、四元式序列分别为-After the abstract syntax tree arithmetic expressions were preorder, you can get input expression quaternion corresponding sequence (Experiment 4 to use th
tree
- 天津大学树,二叉树,堆的复习资料。适合初学者使用。比较倾向acm-Tianjin University of trees, tree, heap review the information. Suitable for beginners to use. Compare tendency acm
binarytree
- 根据中后续遍历建立二叉树,并且输出其前序遍历-According to the subsequent establishment of a binary tree traversal, and the output of its preorder traversal
C_binary_tree
- c语言实现二叉树简单教程,介绍二叉树的基本原理-c language tutorial simple binary tree
MINIX-File-System-analysis
- 文详细分析了MINIX文件系统的磁盘布局及其在Linux OS中的实现。站在当今时代,MINIX文件系统是如此简陋,以至于在现实中几乎没有实用 价值。但它毕竟曾经是教学操作系统MINIX的主文件系统,最初的Linux也是在MINIX文件系统上开始成长的。在Linux内核源代码树中依然保留 着MINIX File System的分支,而且它依然被维护,以与Linux文件系统的架构变化同步。从实用角度说,实在没有这个必要,但Linus Torvalds 还保留着它,或许Linus有点舍不
1
- 对记录序列(查找表):{55,13,23,72,109,67,2,78,13}分别实现如下操作: 1) 顺序查找; 3) 对排好序的纪录序列表进行折半查找; 4) 利用1)中记录序列建立一颗二叉排序树,并在其上实现特定关键字值结点的查找; 5) 按照“除留余数法”哈希构造函数和线性探测再散列的冲突处理方法创建表长为m=11的哈希表; 6) 实现5)创建哈希表上的查找 -On the record sequence (lookup table): {} 55,13,23,7
Swing-JTree
- jtree树案例,jtree中树的比较经典案例,很好。-jtree demo
Non-recursive-algorithm-binary
- 二叉树先序、中序、后序三种遍历的非递归算法-Non-recursive algorithm binary first order, in sequence, after three traversal
K-nearest-neighbor-algorithm
- 从K近邻算法、距离度量谈到KD树、SIFT+BBF算法,讲解详细,非常有用-From K neighbor algorithm and distance measurement when it comes to KD tree, SIFT+ BBF algorithm, explain in detail, very useful
c-cpp
- (1) 实现二叉树先序遍历、中序遍历、后序遍历等运算。 (2) 实现计算二叉树叶子结点和交换二叉树中所有结点左右子树的运算 -(1) binary tree preorder, preorder, postorder traversal operations. (2) calculated to achieve binary tree leaf node and all nodes exchange binary sub-tree operations around
Huffman
- 数据结构完成哈弗曼树编码的具体程序以及实验要求-Huffman coding tree data structure to complete the specific procedures and test requirements
classical-algorithm
- 关于经典算法的思考与总结。涵盖KMP.遗传.启发式搜索.图像 特征提取 SIFT.傅立叶变换.Hash.快速排序.SPFA.快递选择 SELECT A*.Dijkstra.DP.BFS/DFS.红黑树等 15 个经典基础算法, 共计 31 篇文章,包括算法理论的研究与阐述,及其编程的具体实现。很多个算法都后续写 了续集-Thinking about the classical algorithm and summary. Covering the KMP. Genetic heuri
coo51
- 利用先序遍历创建链式存储的二叉树,suanfasheji-Use preorder create chain store binary tree, suanfasheji
cSharpdictionary-tree
- c#字典树的实现,学习数据结构的同学们可以-realization c# dictionary tree data structure learning students can look
Binary-tree-list
- 二叉树列表,满足先序遍历递归和非递归,可自由创建-Binary tree list
548945184
- 数据结构的课设。包括哈希表、二叉树以及各种排序算法。应有尽有-Class data structure set. Including hash tables, binary trees, and various sorting algorithms. Everything