搜索资源列表
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
6BinaryTree
- 利用二叉树实现十进制四则运算,并输出结果-Binary tree decimal arithmetic, and outputs the result.
binary-tree-traversal
- 程序功能:遍历二叉树,线索化二叉树,遍历线索化二叉树,二叉树去线索化-The program features: binary tree traversal, threaded binary tree traversal threaded binary tree, binary tree to clues
4
- 编程任务: 对于给定的树,以根结点为起点,对树实现非递归方式广度优先搜索,输出广度优 先搜索序列 数据输入: 由文件input.txt给出输入数据。第1行有1个正整数n,表示给定的二叉树有n个顶 点,编号为1,2,…,n。接下来的n行中,每行有3个正整数a,b,c,分别表示编号为a的结 点的左儿子结点编号为b,右儿子结点编号为c,0表示没有儿子。各结点信息按照层序列表 的顺序给出。-Programming tasks: For a given of t
data-structure
- 数据结构的一些实现技巧,包括二叉树,堆栈,队列-Some of the data structure to achieve skills, including binary, stacks, queues, etc.
binary
- 二叉树的基本操作,遍历,交换左右子树等功能-The basic binary operation
pinghengerchashu
- 数据结构课设 最简单 平衡二叉树 最简单易懂的学生实验报告册!-you know
1
- 线索二叉树部分代码,不是全部,只是其中一部分函数-Threaded binary part of the code, not all, is only part of the function
Huffman
- 哈弗曼编码 利用二叉树来设计二进制的前缀编码,从根结点到叶子结点的路径上分支字符组成的字符串作为该叶子结点字符的编码。-huffman coding
LinkList
- 关于二叉树的,list的一些资料,可以用C++来运行-About the binary tree, a list of some of the data, can be used to run the c++
7.Binary-Search-Tree
- 二叉树收索,包括二叉树的遍历,收索,增加,删除等功能-Close binary search
Binary-usage-reports
- 二叉树使用报告,初学者学习数据结构二叉树部分时时通过对一些简单小问题的思考熟悉二叉树-Binary usage reports, for beginners to learn some binary tree data structure often small problems through some simple binary thinking familiar
huofumanbianmaC
- 帮助初学数据结构的同学快速掌握二叉树构成霍夫曼编码的方法-Help beginner students quickly master data structure binary Huffman coding method constitutes
tree
- 天津大学树,二叉树,堆的复习资料。适合初学者使用。比较倾向acm-Tianjin University of trees, tree, heap review the information. Suitable for beginners to use. Compare tendency acm
1212210237
- 使用C语言来写出算术表达式与二叉树的编程-Using C language to write binary arithmetic expressions and programming
binarytree
- 根据中后续遍历建立二叉树,并且输出其前序遍历-According to the subsequent establishment of a binary tree traversal, and the output of its preorder traversal
C_binary_tree
- c语言实现二叉树简单教程,介绍二叉树的基本原理-c language tutorial simple binary tree
erChaiTree
- 可以输出二叉树的左右子树,以及判定该树是否为二叉树,是二叉树中的基础-it is fundumentaul