搜索资源列表
C--
- 二叉树的各种函数功能的实现,功能比较全面,已经全部通过运行-Binary function of the realization of various functions, features a more comprehensive, have all been run through
C
- 成功使用C-C++编译的代码 含有数据结构:树,图,栈,二叉树,等得内容以及经典C课程实验设计代码-Include Datastruct s field,such as,Stack,Tree,Binary Tree,and Graph!all can be Travers in Turb C 2.0 or C-C++ System.
C-language-five-code
- 上课时候老师布置的几个数据结构的作业,主要是:队列,散列查找,Josep出列,二叉树,排序-When the class teacher assigned several data structure of assignments, mainly, queue, hash find, Josep row, binary tree, sort, and so on
c
- 经典算法:已知树T中结点的前序和中序序列分别放在字符型数组a1,a2中,试编写构造此二叉树的算法。-The classical algorithm: the known tree T node in the preorder and inorder sequence on the character array a1, a2, try to write the constructed binary tree algorithm.
erchashu
- 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c 二叉树.c-failed to translate
2009082183
- 数据结构 C语言 C++ 二叉树 功能实现 深度广度层次 初学者适合-Data structure C the language C++ binary tree features in-depth, level beginner suitable
erchashu.c
- 对二叉树进行创建,寻找父节点,子节点,同时进行广度遍历-Create a binary tree to find the parent node, child nodes, while the breadth traversal
BTree(C)
- 转换二叉树与广义表(C语言),有助于大家了解二叉树的定义。-Convert a binary tree with broad table (C language), will help you understand the definition of the binary tree.
data-structure--C
- C编程实现栈、队列、二叉树的顺序存储和链式存储-C programming sequence of stacks, queues, binary tree to store and chain store
c-erchashubianli
- 建立一棵二叉树,并对其进行遍历(先序、中序、后序),打印输出遍历结果。-Create a binary tree, and traverse the results of its traversal (preorder, inorder, postorder), print output.
c-data-struct
- 数据结构文档 包含栈队列二叉树排序等基础知识-data struct word documents
tree
- C二叉树泛型编程,实现一个二叉树所有的功能。-C binary generic programming
BiTreeLink
- 数据结构中用objective-c二叉树的实现-Data structure used to achieve objective-c binary
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
C
- C语言二叉树问题,详细的实现了二叉树的功能,并且还有录入文件的功能,删除文件内容的功能,通过单链表可以实现文件的录入,删除,查找,浏览,修改等功能.-C binary tree, the function of the detailed implementation of a red-black tree, and the function of the input file, delete the file content function, through singly linked lis
c
- 本次试验的主要要点是哈夫曼树的建立过程,这种算法的思路是: 1)依据给定的n个权值{W0,W1,……,Wn-1}构造n棵只有一个根结点的二叉树,这些二叉树组成一个森林F={T0,T1,……,Tn-1}。 2)在森林F中选取两棵根结点的权值最小的二叉树作为左、右子树合并成一棵新的二叉树,这棵新的二叉树的根结点的权值等于其左、右子树根结点的权值之和。这样一来,森林中就减少了一棵树。 3)重复上一步,直到森林F中只有一棵二叉树为止,这棵二叉树便是要得到的哈夫曼树 二叉树建立好之后,通过
Tree
- C++二叉树,前序遍历中序遍历后序遍历递归,非递归版都有-C++ binary tree, traversing the recursive traversal after the preorder traversal, non recursive
tree-4.c
- 二叉树查找代码,每层两个孩子 一共五层 自己写的 欢迎下载-Find binary code, a total of five two children each write their own are welcome to download
数据结构
- 通过给定二叉树的先序和中序确定唯一一个二叉树,并以各种方式输出
C-Interfaces-And-Implementations
- 将一些数据结构在C中用接口技术组织好,通过main函数统一测试,包括二叉树,AVL树,链表,五种排序等。main函数为测试。-Some of the data structure in C interface technology to realize