搜索资源列表
C实现二叉树
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
C实现二叉树
- 数据结构课程设计内容：模拟二叉排序树，用链表的形式实现二叉树．-curriculum design data structure : two simulated fork sort tree with Chain in the form of a binary tree.
baseexp3
- 本实验由以下环节组成： 1） 存储结构 以二叉链表或三叉链表作为二叉树的存储结构； 2） 二叉树的创建(链式存储) 以某一种遍历的次序录入二叉树的元素，写出相应的二/三叉链表的创建算法，并上机实现该算法； -In this study, composed of the following aspects: 1) The storage structure to two or three-pronged fork linked list is stored as a binar
juCCDpxg
- 本文介绍一种新颖的基于灰度积分的十字叉丝位t确定的方法，可以达到亚像素级精度，具有运算简便、适用性强、移植性好等特点。 -This paper presents a novel based on gray silk-bit integral cross fork t identified methods to achieve sub-pixel precision, with simple operation, applicability, portability is good.
Qurive
- 基于LabVIEW的石英音叉陀螺闭环驱动的实现-Quartz tuning fork gyroscope based on LabVIEW implementation of closed loop drive
playmusic
- 自己制作的钢琴校音软件。钢琴校音系统包含“钢琴校音系统”和“钢琴校音系统（音叉测试版）”两个版本。其中，钢琴校音系统”是专门为钢琴校音而制作的软件-Piano tuner software to produce their own. Piano school sound system includes a " piano tuner and piano tuner system (tuning fork test version)," two versions. Which,
andian
- 假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。 试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。-In the following descr iption of the three tuple hypothesis
tree1
- 建立一个十叉非完全树，递归算法实现，使用两个链表实现，一个孩子节点链表，一个兄弟节点链表-Establish a ten fork complete tree recursive algorithm uses two linked list implementation, a child node linked list, a sibling node linked list
xxfpm
- Windows上使用CreateProcess创建进程，使用WaitForSingleObject等待进程结束；Linux上使用fork和execl创建进程，使用waitpid等待进程结束-Windows using CreateProcess to create process, use the WaitForSingleObject wait for the process ends Linux using fork and execl creation process, use wait
huawei-program-test
- 华为上机实例 包含英语句子单词翻转程序、二叉树遍历（前序、中序、后序）和深度测试程序-uawei knitting examples include English word sentence inversion procedure, two fork tree traversal (pre order, in sequence, after the sequence) and depth testing program
Datastructure
- 数据结构相关编程，包括查找和排序，二路归并排序，链表的应用，树和二叉树，顺序表，无向图，有向图。-Related programming data structures, including search and sort, two way merge sort, list, tree and two fork tree, the order of the table, undirected graph, digraph
TreeOperation
- 实现了二叉树的创造，以及它的插入，删除，添加，修改。佩服了界面的优化和操作指南-ON划词翻译ON实时翻译 Realization of creating the two fork tree, and its insert, delete, add, modify. Admire the guide and to optimize the operation interface
bintree-MFC
- 输入二叉树节点数,动态演示二叉树的中序遍历生成,MFC编写,有界面截图-Enter the two fork tree nodes, in order traversal generation, dynamic demonstration of two tree MFC prepared, there are screenshots
Aohj
- Java 多线程 快速排序 1亿数据 3.5秒 写了个Fork/Join的，但好像并没有更快。-Java multi-threaded data quickly sort 100,000,000 3.5 seconds to write a Fork/Join, but does not seem to be faster.
First-root-traversal-non-recursive
- 二叉树的非递归先根遍历遍历 二叉树的非递归先根遍历 -Two fork tree of non recursive traversal traversal Two fork tree of non recursive traversal traversal
Trail-two-fork-tree
- 线索二叉树的vc++编程实现，线索二叉树的vc++编程实现。-Threaded binary c++ programming.Threaded binary c++ programming.
3
- 实现数据结构，二叉树的代码-Achieve data structure, the code of the two fork tree
6.49
- 用比较二叉树左右子树的深度的方法，以递归形式，判断该二叉树是否为完全二叉树-Using the method of comparison about two tree subtree depth, in a recursive form, the judgment of the two fork tree is completely two fork tree
Cpp1
- 以（F,C,L/R）三元组序列表示一颗二叉树（其中F表示该结点的父结点，C表示结点的值,L/R表示与父结点的关系），并由该序列创建链表结构的二叉树T-In (F, C, L/R) three tuple sequence represents a two fork tree (where F represents the parent node of the node, C represents the value of the node, L/R represents the relation
A fork of AFL for fuzzing Windows binaries
- 一个FORK的AFL用于对windows二进制文件进行模糊测试。里面是源代码。(A fork of AFL for fuzzing Windows binaries)