文件名称:lab4_2
- 所属分类：
- 数据结构常用算法
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2013-01-16
- 文件大小：
- 2.47mb
- 下载次数：
- 0次
- 提 供 者：
- 梁*
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
2-1以顺序栈作为存储结构 实现顺序栈的入栈运算,出栈运算,并且读取栈顶元素；
2-2以链栈作为存储结构,实现栈上的数据元素的插入运算,删除运算,并读取链栈的栈顶元素；
2-3 以循环队列喂存储结构,实现循环队列的建立,实现循环队列的入队运算,出队运算；
2-4用栈实现括号的匹配问题；
2-5实现汉诺塔问题.；
3-1采用链式存储表示,按给定的先序序列创建二叉树,并输出二叉树。
3-2-1和3-2-2采用二叉链表作为存储结构,建立二叉树,采用递归算法实现二叉树遍历,另外采用非递归算法实现二叉树遍历。
3-3采用二叉树作为存储结构,实现对二叉树的线索化,中序遍历线索二叉树
4-1-1、4-1-2、4-1-3以邻接结构作为存储结构,定义图节点vertexnode,实现图的下列运算：a以邻接表作为存储结构建立图，b按照深度遍历算法遍历图，c按照冠以算法遍历图
4-2用普利姆算法求图的最小生成树，并且分析时间复杂度和空间复杂度-2-1 stack in the order as the storage structure to achieve sequential stack push operation, the stack operation, and read the top element
2-2 chain stack as a storage structure, to achieve the insertion of the data element in the stack on the operator to delete the operation, and reads the chain top of the stack element
2-3 in a circular queue feed storage structures, and the establishment of the circular queue, circular queue enqueue operation dequeue op
2-4 with stack parenthesis matching
2-5 the Towers of Hanoi problem.
3-1 chain store said that according to a given set of first-order sequence to create a binary tree, and outputs a binary tree.
3-2-1 and 3-2-2 binary list as the storage structure, the establishment of a binary tree, using recursive the algorithm binary tree traversal, In addition to the use of non-recursive algorithm binary tree traversal.
3-3 binary tree as a storage structure clues of binary tree in preorder traversal threaded binary
4-1-1,4-1-2,4-1-
2-2以链栈作为存储结构,实现栈上的数据元素的插入运算,删除运算,并读取链栈的栈顶元素；
2-3 以循环队列喂存储结构,实现循环队列的建立,实现循环队列的入队运算,出队运算；
2-4用栈实现括号的匹配问题；
2-5实现汉诺塔问题.；
3-1采用链式存储表示,按给定的先序序列创建二叉树,并输出二叉树。
3-2-1和3-2-2采用二叉链表作为存储结构,建立二叉树,采用递归算法实现二叉树遍历,另外采用非递归算法实现二叉树遍历。
3-3采用二叉树作为存储结构,实现对二叉树的线索化,中序遍历线索二叉树
4-1-1、4-1-2、4-1-3以邻接结构作为存储结构,定义图节点vertexnode,实现图的下列运算：a以邻接表作为存储结构建立图，b按照深度遍历算法遍历图，c按照冠以算法遍历图
4-2用普利姆算法求图的最小生成树，并且分析时间复杂度和空间复杂度-2-1 stack in the order as the storage structure to achieve sequential stack push operation, the stack operation, and read the top element
2-2 chain stack as a storage structure, to achieve the insertion of the data element in the stack on the operator to delete the operation, and reads the chain top of the stack element
2-3 in a circular queue feed storage structures, and the establishment of the circular queue, circular queue enqueue operation dequeue op
2-4 with stack parenthesis matching
2-5 the Towers of Hanoi problem.
3-1 chain store said that according to a given set of first-order sequence to create a binary tree, and outputs a binary tree.
3-2-1 and 3-2-2 binary list as the storage structure, the establishment of a binary tree, using recursive the algorithm binary tree traversal, In addition to the use of non-recursive algorithm binary tree traversal.
3-3 binary tree as a storage structure clues of binary tree in preorder traversal threaded binary
4-1-1,4-1-2,4-1-
(系统自动生成,下载前可以参看下载内容)
下载文件列表
lab4_2\4_2.cpp
......\Debug
......\.....\4_2.obj
......\.....\lab_2.exe
......\.....\lab_2.ilk
......\.....\lab_2.obj
......\.....\lab_2.pch
......\.....\lab_2.pdb
......\.....\lab4_2.exe
......\.....\lab4_2.ilk
......\.....\lab4_2.pch
......\.....\lab4_2.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\lab_2.cpp
......\lab_2.dsp
......\lab_2.dsw
......\lab_2.ncb
......\lab_2.opt
......\lab_2.plg
......\lab4_2.dsp
......\lab4_2.dsw
......\lab4_2.ncb
......\lab4_2.opt
......\lab4_2.plg
...2_1\2_1.cpp
......\Debug
......\.....\2_1.obj
......\.....\lab2_1.exe
......\.....\lab2_1.ilk
......\.....\lab2_1.pch
......\.....\lab2_1.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\lab2_1.dsp
......\lab2_1.dsw
......\lab2_1.ncb
......\lab2_1.opt
......\lab2_1.plg
.....2\2_2.cpp
......\Debug
......\.....\2_2.obj
......\.....\lab2_2.exe
......\.....\lab2_2.ilk
......\.....\lab2_2.pch
......\.....\lab2_2.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\lab2_2.dsp
......\lab2_2.dsw
......\lab2_2.ncb
......\lab2_2.opt
......\lab2_2.plg
.....3\2_3.cpp
......\Debug
......\.....\2_3.obj
......\.....\lab2_3.exe
......\.....\lab2_3.ilk
......\.....\lab2_3.pch
......\.....\lab2_3.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\lab2_3.dsp
......\lab2_3.dsw
......\lab2_3.ncb
......\lab2_3.opt
......\lab2_3.plg
......\lab2_3.sln
......\lab2_3.suo
.....4\2_4.cpp
......\Debug
......\.....\2_4.obj
......\.....\lab2_4.exe
......\.....\lab2_4.ilk
......\.....\lab2_4.pch
......\.....\lab2_4.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\lab2_4.dsp
......\lab2_4.dsw
......\lab2_4.ncb
......\lab2_4.opt
......\lab2_4.plg
.....5\2_5.cpp
......\Debug
......\.....\2_5.obj
......\.....\lab2_5.exe
......\.....\lab2_5.ilk
......\.....\lab2_5.pch
......\.....\lab2_5.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\lab2_5.dsp
......\lab2_5.dsw
......\lab2_5.ncb
......\lab2_5.opt
......\lab2_5.plg
...3_1\3_1.cpp
......\Debug
......\.....\3_1.obj