搜索资源列表
twotrees
- 二叉树的数据结构算法 包括二叉树的创建、遍历、输出等，可以作为课程设计的原材料-Binary tree data structure algorithms, including tree creation, traversal, output and so on, can be used as raw materials for curriculum design
66666
- 创建一颗线索二叉树，主要利用了数据结构的知识和递归算法，最后能够遍历整颗树的信息-Creating a threaded binary tree, the main advantage of the knowledge and recursive data structures algorithms, and finally be able to traverse the whole tree information
processcreat
- 进程创建模拟 针对操作系统中进程创建相关理论进行实验。要求实验者输书提供的代码并进行测试。代码简化了进程创建的多个步骤和内容。进程的树形结构采用广义二叉树的方式进行存储。-Process simulation for the operating system in the process of creating theories to create the experiment. Asked the experimenter to provide written input and teste
BTree
- 二叉树的递归以及非递归创建，遍历，遍历包括前序.中序.后序.....，在其非递归创建和遍历时又分别利用了栈和队列等一系列方法进行-Recursive binary tree non-recursive traversal, as well as create, including the former sequence traversal sequence after sequence. .....
tree
- 创建二元二叉树，输出二叉排序树，在二叉排序树中查找相关结点，递归查找.-Create binary tree, output binary sort tree，search relevant nodes in the binary sort tree.
binary-tree
- 二叉树的创建，二叉树中结点的查找，测二叉树的深度宽度，输出二叉树的叶子结点-Binary tree creating, search binary tree node , the binary tree s depth and width, output binary tree leaf nodes
hwk2
- 父子进程创建，计算子进程的最大返回值。子进程呈现二叉树形式。-Sons process creation, the maximum return value of the child process. The child presents binary form.
binary-tree
- 用二叉链表存储二叉树，用“扩张先序遍历序列”创建二叉链表，对二叉树进行前、中、后序的遍历以及层次遍历，输出度为0、1、2的节点及节点数，线索化二叉树，根据线索化的二叉树查找二叉树中任意节点的前驱、后继，通过线索二叉树进行二叉树节点的删除、插入，以及按树状打印二叉树。-Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, th