搜索资源列表
8.2
- 利用二叉树层次遍历求二叉树的宽度(二叉树的宽度即二叉树同层结点数的最大值)(Judge the width of the two fork tree)
二叉树
- 二叉树的基本操作,包括先序中序后序的递归和非递归(Two basic operations of the tree, including the first order, the order, the order of recursive and non recursive)
Desktop
- 数据结构 java版本 二叉树的创建 序遍历,中序遍历,后序遍历 +考试题目(Ordered traversal, inorder traversal, backward traversal)
二叉树的比较
- 典型的C++中的排序问题,这是二叉树比较的c++源码(Typical C++ sorting problem, which is the two tree comparison c++ source)
BinaryTree
- 二叉树前序中序后序遍历遍历代码,使用c++编写(Two fork tree preorder, in order, after traversal traversal code, using c++ write)
tree
- PHP实现二叉树,PHP + html 实现二叉树显示(PHP implementation of two fork tree, PHP + HTML implementation, two fork tree display)
第4单元(树和二叉树)
- 与数据结构相关的知识,第四单元,树和二叉树相关知识(The file is about programming ,compliers principles and data.It will have much help for you in your study.)
1111
- 二哥学了二叉树的顺序存储后,被下面一个问题难住了,于是他请你帮他解决。给你一个前序遍历和中序遍历,问顺序存储的数组是什么样子的。 Example Input Format 第一行为前序遍历,第二行为中序遍历,节点个数不超过26. Output Format 输出一行,表示顺序存储的数组,以空格隔开,NULL表示空节点,数组空间不超过1000个节点(The second order storage learned two tree, asked the next questi
SeqBiTree
- 顺序存储结构下的二叉树创建和初始化,二叉树的顺序存储表示结构定义(Definition of sequential storage representation structure for two binary tree)
bintree
- 主要为二叉树的遍历,涉及到前序遍历、中序遍历、后序遍历,以及左右孩子的交换后的遍历(内附c&c++操作手册)(It is mainly used for binary tree.)
binary tree
- 实现二叉树,实现三种遍历,计算结点数等操作(The realization of the two binary tree)
二叉树的实现
- 给出了在全线索二叉树中插入结点和二叉树的算法,然后阐述了这种运算的特点。(This paper gives the algorithms inseting root-node and binary tree in all threaded binary tree.)
作业6_3
- 实现二叉树先序、中序、后序遍历,包含递归算法、非递归算法,以及求树的深度。(To achieve two tree preorder, inorder, post traversal .)
complete_binary_tree
- 该源文件代码说明了完全二叉树的一种构建方法(the soure file illustrates how to build a complete binary tree.)
TEE
- 二叉树基本操作,包括如何建树,将二叉树叶子节点串为一个单链表等等(The fuxxking net require upload things to get download priority,I am forced to it)
2
- 二叉树的简单上机实验,有助于理解二叉树的结构,以及遍历、层级等等。(The simple experiment of two forked trees helps to understand the structure of the two forked tree, as well as the traversal, the hierarchy, and so on.)
swap
- 以二叉链表作存储结构,编写一个算法将二叉树左、右子树进行交换的算法(The two fork chain table is used as the storage structure to write an algorithm to exchange the left and right subtrees of the two fork tree.)
二叉树.cpp
- 二叉树的基本操作,二叉树的中序,先序遍历,后序遍历,层次遍历,二叉树家电个数以及二叉树的复制操作的实现(The basic operation of the binary tree)
4
- 二叉树的基本功能,建立,遍历,递归与非递归(The basic functions of the two forked tree)
等差数列,二叉树等
- 等差数列,二叉树的操作,包括重构,序列化和反序列化,堆棋子(Arithmetic progression, two binary tree operations, including reconstruction, serialization and deserialization, heap pieces)