搜索资源列表
BiTree
- 输入一个字符串，并建成一棵二叉树，满足左子树的字符都要小于根结点的字符，右字树的字符都要大于根结点的字符，每个结点值有字符和字符的出现次数，并用三种遍历方法打印，比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。-Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must be less than the root node of the
cengcibianlierchashu
- C语言版的数据结构，利用层次遍历二叉树算法实现C语言的编程-C language version of the data structure, binary tree traversal algorithms using level C programming language
Depth-firsttraversalalgorithmforbinarytree
- 用c语言编程实现二叉树的深度算法遍历二叉树-Binary tree with c language programming to realize the depth of binary tree traversal algorithm
erchashu
- 二叉树的构建掌握基于先序遍历构造二叉链表的算法-Construction of binary tree
erchashu-
- C语言实现二叉树的创建 及先序、后序、层序遍历，输出树的深度，每一层节点个数，叶子总数-Creation and the first sequence of binary tree in C language, the order of the sequence traversal, output the depth of the tree, each layer the number of nodes, leaves the total number of
twotree
- 二叉树的非递归中序遍历+C代码 二叉树的非递归中序遍历+C代码 -two tree+C
kmp
- 由遍历序列回复二叉树文档介绍 还不错 可以-Reply binary tree traversal sequence document presentation also can look at
10060324
- 二叉树主要完成以下功能: 1. 建立二叉树 2. 计算结点所在的层次 3.统计结点数量(size)和叶结点数量 4.计算二叉树的高度 5.计算结点的度 6.找结点的双亲(Parent)和子女 7.二叉树的遍历 8.二叉树的输出-Main binary tree complete the following features: 1. The establishment of a binary tree. Calculate the junction point w
birary-treea-and-integer
- 这是我的一个笔试题，是把整数放到二叉树中的一个题发上来给大家看看（采用中序遍历）。希望对大家找工作有帮助-This is a pen test, is the integer into a binary tree in a title made up for everyone to see (in preorder traversal). People looking for work
bitree
- 构造一棵二叉树、释放二叉链表中各结点的存储空间、获取指向二叉树根结点的指针、前序遍历二叉树、中序遍历二叉树、后序遍历二叉树等的编程-Construct a binary tree, the release of storage space for each node in the binary list, access points to the binary tree root pointer, before traversing Binary inorder binary tree trav
Tree
- 二叉树的相关功能,如遍历，求深度宽度繁茂度等-Functions of Binary Trees
5
- 二叉树的三种遍历，求深度、叶子，按层次遍历，-Binary tree traversal, and depth leaves hierarchy traversal
classical-algorithm-VCPP
- 常用的算法经典代码，包括快速排序，冒泡排序等各种排序方法，还有二叉树的前序、中序和后序遍历等-The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.
Binary-tree
- 课程设计数据结构二叉树的遍历的C++语言的实现方法-Binary tree data structure traversal method
Binary-Tree
- 对二叉树进行操作，包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
Cpp1
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
erchashu
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
binary-tree-traversal
- 程序功能：遍历二叉树，线索化二叉树，遍历线索化二叉树，二叉树去线索化-The program features: binary tree traversal, threaded binary tree traversal threaded binary tree, binary tree to clues
binary
- 二叉树的基本操作，遍历，交换左右子树等功能-The basic binary operation
7.Binary-Search-Tree
- 二叉树收索，包括二叉树的遍历，收索，增加，删除等功能-Close binary search