搜索资源列表
shujujiegou-erchashu
- 叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( \\n )为输入结束标志,输入数列L,生成二叉排序树T; (2)对二叉排序树T作中序遍历,输出结果; (3)计算二叉排序树T的平均查找长度,输出结果; (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结 点,并作中序遍历(执行操作2);否则输出信息“无结点x”; (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK!”/“NO!”;-fork trees and
erchashubianli
- 二叉树遍历问题是重要的问题。程序的实现简单而方便。-erchashu
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
erchashu
- 建立简单二叉树,包含其他的一些小程序,可能会存在错误,不是很完善-erchashu
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
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
erchashu
- 二叉树遍历 二叉树先序、中序、后序遍历的递归算法递归算法-First binary sequence binary tree traversal, recursive algorithm in order, after the preorder of recursive algorithm