搜索资源列表
3adf
- 遍历是二叉树各种操作的基础,显示,遍历过程中可以对各结点进行各种操作,又实现各种的目的。-traverse binary tree is the basis for various operations, that the process can traverse the nodes of various operations, Also achieve various objectives.
shujujiegou-erchashu
- 叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( \\n )为输入结束标志,输入数列L,生成二叉排序树T; (2)对二叉排序树T作中序遍历,输出结果; (3)计算二叉排序树T的平均查找长度,输出结果; (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结 点,并作中序遍历(执行操作2);否则输出信息“无结点x”; (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK!”/“NO!”;-fork trees and
shuxingshiyanjiegou
- 1)熟练掌握二叉树的二叉链表表示及前序创建算法与实现; 2)熟练掌握二叉树的前序、中序和后序递归遍历算法与实现; 3)掌握中序遍历线索二叉树的基本算法与实现 4)掌握中序遍历线索化二叉树的算法与实现
00517
- 二叉树的应用,包括建立,遍历,以及求深度等。-Have a try!
shujujiegou
- 实现对任意给定的二叉树(顶点数自定)建立它的二叉链表存贮结构,并利用栈的五种基本运算(置空栈、进栈、出栈、取栈顶元素、判栈空)实现二叉树的先序、中序、后序三种遍历,输出三种遍历的结果。-Any given realization of the binary tree (self-Vertices) the establishment of its chain store binary structure, and use the five basic computing stack (The s
tree
- 二叉树的创建、递归遍历算法及其它基本操作的实现-The creation of a binary tree, recursive traversal algorithm and the realization of other basic operations
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
graph-theory-and-program-designe
- 详细的介绍了图论的各种概念如:分叉树,最短路径,遍历等以及相应的程序设计-A detailed descr iption of the various concepts of graph theory such as: the bifurcation tree, shortest path, traverse, and the corresponding program design
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
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
Tree
- 二叉树的相关功能,如遍历,求深度宽度繁茂度等-Functions of Binary Trees
5
- 二叉树的三种遍历,求深度、叶子,按层次遍历,-Binary tree traversal, and depth leaves hierarchy traversal
duijiaojuzhen
- 实现任意对角对称矩阵的压缩存储,可以便于树与图的存储,遍历等操作。-Any symmetric matrix diagonal compression and storage, easy tree storage traversal and other operations.
Binary-Tree
- 对二叉树进行操作,包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
binary
- 二叉树的基本操作,遍历,交换左右子树等功能-The basic binary operation
7.Binary-Search-Tree
- 二叉树收索,包括二叉树的遍历,收索,增加,删除等功能-Close binary search
DoubleLinkedList
- java的二叉树写法,基本思路为,二叉树的遍历-a base java project
数据结构上机实验——二叉树
- 根据二叉树的抽象数据类型的定义,使用二叉链表实现一个二叉树。 二叉树的基本功能: 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 9、其他:自定义操作 编写测试main()函数测试线性表的正确性