搜索资源列表
线索树
- 本文用C语言实现了有关线索二叉树的一系列算法-Using C language of the clues to a series of binary tree algorithm
二叉树的高度程序!
- 本文用C语言实现了求二叉树深度的程序,数据结构采用链表-Using C Language for the depth of procedures binary tree data structure used Chain
BinTree11
- 二叉树的建立和遍历
tree
- 最小生成树 算法 利用二叉树原理生成最小生成书 数据结构实验-Principle of minimum spanning tree algorithm uses a binary tree data structure generated experimental Smallest Book
MyTree
- 在控制台实现了二叉树的树状打印, 方便形象-Print in the console of a binary tree tree
BinTreeExp
- 二叉树的创建、前序递归遍历、中序递归遍历、后序递归遍历、层次遍历、前序非递归遍历、中序非递归遍历、后序非递归遍历算法。里面包含了顺序栈和队列的实现代码。-Binary tree creation, pre-order recursive traversal, recursive in order traversal, postorder recursive traversal, traverse the level, pre-order traversal non-recursive, in t
erchashuquanbugongneng
- 二叉树的全部功能实现模块,对学数据结构的大学生来说说个好东西,已经通过编译实现!-Binary tree to achieve the full functionality of modules, data structures for school students for the good things that have been adopted to achieve the compiler!
traverse
- 后续遍历非递归 数据结构中二叉树的遍历中 使用后续遍历非递归遍历二叉树-Follow-up data structure traversal non-recursive traversal of binary tree used in the follow-up traversal non-recursive binary tree traversal
Complete_binary_tree
- 在完全二叉树中,在层次遍历和先根序遍历中,已知某节点在一种遍历中的编号,求该节点在另一种遍历中的编号.-Complete binary tree in level order traversal and first traversal of the root, known to a certain node in a traversal of the code, and the node in a traversal of the code.
binary_tree
- 这个程序是关于二叉树的实现。是去年做的,关于遍历二叉树之类的。-the implement of binary tree
Glist_in_Creat_Bitree__inorder_out
- 对广义表形式的输入的字符串建二叉树,并中序输出-In put a Glist and Create a Binary Tree with it then output the Binary tree inorder
dd
- 二叉树先序遍历 实验代码 asd asd -Visiting Binary Tree Experiment code
bintree
- 对一个二叉树进行各种运算,包括获取节点的子树节点数,节点层数,节点子树的最大值等等。-Various operations on a binary tree, including access to the sub-tree nodes in the node, the node number of layers, so the maximum value of the node subtree.
heapsort
- 堆排序(HeapSort)是一树形选择排序。堆排序的特点是:在排序过程中,将R[l..n]看成是一棵完全二叉树的顺序存储结构,利用完全二叉树中双亲结点和孩子结点之间的内在关系(参见二叉树的顺序存储结构),在当前无序区中选择关键字最大(或最小)的记录-Heap Sort (HeapSort) is a tree selection sort. Heap sort is characterized by: the sort process, the R [l.. N] as a complete b
61008224-Exp7_BSTree
- 利用二叉树完成数据的分解,比较,排列以及其他二叉树常用应用-Using a binary tree for data decomposition, compare, rank
BinaryTree
- 学习数据结构课程中二叉树基本操作算法实现-Binary Tree
Bitree
- 二叉树非递归,bitree。。二叉树非递归,bitr-no
76590221_83_hw4
- 一共3个源码,分别实现了有障碍的完全图的最小二叉树生成,以及一个用优先队列实现的优先级排序问题。详见内附文档。-A total of three source, respectively, are obstacles to achieving a complete map of the smallest binary tree generation, and a priority queue implemented with priority scheduling.
BinaryTree
- 本程序实现二叉树的遍历,绝对原创。质量高!-A very good program .
BinaryTreeBasicComputing
- 用C语言编写的二叉树的基本操作(欢迎下载)-Binary tree s basic computing