搜索资源列表
c.resourse
- 包含五个C源码，分别是：IP地址解析、二叉树算法集、广度优先搜索及深度优先搜索、华氏温度和摄氏温度的相互转换、用for循环模拟自由落体运动。-Contains five C source code, namely: IP address resolution, binary tree algorithm set, breadth-first search and depth-first search, Fahrenheit and Celsius temperature of one anoth
BinaryTree
- 数据结构中二叉树的实现以及先序，中序，后序的遍历，并且有计算叶子结点，深度等等附加功能-Data Structure：Binary Tree,achieve some functions like:preorder,inorder,postorder,depth calculation,node calculation and so on.
bitree
- 二叉树的建立与遍历，以及求二叉树的叶子节点数，节点数，树的深度等。并用主函数调用各个子函数，功能非常全。建立二叉树的原理是先把二叉树看成完全二叉树，然后对各节点编号，利用二叉树的性质建立二叉树。-Establishment of the binary tree traversal, and the demand nodes in binary tree leaves, nodes, depth of the tree. With the main function calls each sub
btree
- 对二叉树进行各种操作，包括建立，求深度，求节点个数和叶子节点个数，用括号表示法表示二叉树，查找指定节点的左右孩子，销毁二叉树-Various operations on the binary tree, including the establishment, seeking the depth of demand node number and leaf node number, said binary notation with parentheses, to find about the
binarytree
- 输入二叉树的前序排列以及中序排列，对二叉树进行遍历，并计算二叉树叶子节点总数以及树的深度。-Input binary tree arrangement of the first order and arrangement in the sequence of binary tree traversal, and calculate the total number of binary tree leaf nodes and tree depth.
tree
- 按先序遍历的扩展序列建立二叉树的存储结构 二叉树先序、中序、后序遍历的递归算法 二叉树中序遍历的非递归算法 二叉树层次遍历的非递归算法 求二叉树的深度(后序遍历) -By first traversing the expansion of the storage structure of binary sequences to establish the first order binary tree, in order, after traversing a binary
AVLTree
- 平衡二叉树。高效的搜索算法。生成深度最小的二叉搜索树。在大量数据中最快实现搜索。-Balanced binary tree. Efficient search algorithm. Generated the smallest depth binary search tree. Large amounts of data to achieve the fastest in the search.
binarytreedepth
- 求二叉树的深度、前中后序遍历的非递归算法-Seeking depth of binary tree, before, during and after traversing a non-recursive algorithm
traverse-binary-tree
- 二叉树的先序中序以及后序遍历及深度输出 代码简短有效无措-Binary tree traversal and depth of the output
93939393939
- 数据结构中二叉树、堆栈、队列以及深度优先与广度优先算法实现-Binary tree data structure, stack, queue and the depth first and breadth-first algorithm
Depth-firsttraversalalgorithmforbinarytree
- 用c语言编程实现二叉树的深度算法遍历二叉树-Binary tree with c language programming to realize the depth of binary tree traversal algorithm
chenlin
- 以二叉链表作为存储结构 由用户输入一棵二叉树 使用菜单界面 分别输出二叉树的先序、中序和后序遍历下的结点访问次序 输出二叉树的深度 输出二叉树中所有的叶子结点及其数目。-Linked list to binary storage structure from user input as a binary tree binary tree using the menu interface, the output of the first order, respectively,
tree
- 题目：生成如下二叉树，并用深度先序遍历输出结果 要求：用程序实现 说明：先生成如下所示的二叉树，然后先序遍历输出其结果：1243576 -Title: Generation as a binary tree, and use the depth first traversing the output requirements: to achieve with the program Descr iption: Mr. into the binary tree as shown
Depthtraversaltree
- 深度遍历二叉树， 使用C++语言编写的深度遍历二叉树的程序，数据结构的经典程序-Depth traversal tree, using the C++ language program traversing a binary tree the depth of the data structure of the classic procedure
Untitled5
- 树的操作 能够实现一些基本的二叉树的交换和深度判断-Tree operations to achieve some basic binary assessment of the depth of exchange and
shu
- 输入先序遍历二叉树，然后中序及后序遍历输出，以及输出输的深度-Enter the first binary tree traversal, and then in the post-order traversal sequence and output, and the depth of the output lost
BinaryTreeAlgorithm
- 二叉树算法，包括建树，前序，中序，后序的递归与非递归算法，还有结点深度等算法。-Binary tree algorithm, including the contribution, the first order, in order, after the order of the recursive and non recursive algorithm, as well as algorithms such as junction depth.
shiyan6
- 编写递归算法，计算二叉树的深度和二叉树中叶子结点的数目-Write a recursive algorithm to calculate the depth of binary tree and binary tree the number of leaf nodes
0
- c写的二叉树 包括二叉树的建立并用深度优先算法进行搜索-I hope it will help you!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
bintree
- C++实现求二叉树的深度（递归·非递归）·遍历（递归，非递归）-C++ realization for binary tree depth (recursion · the recursive) · traversal (recursion, the recursive)