搜索资源列表
erchashushixian2
- 1. 用二叉链表保存二叉树 2. 以基于二叉树的先序序列创建立二叉树 3. 按前序、中序、后序遍历二叉树（三选一）
ThreeOrder
- 利用二叉树的逻辑结构、链式存储结构等，实现二叉树的前序、中序和后序遍历算法 -The logic of the use of binary tree structure, the structure of chain stores and so on, to achieve the first order binary tree, in order and post-order traversal algorithm
java1
- 程序介绍：对树的一些常用操作进行了封装，包括查询，插入，删除，遍历二叉树（中序，后序，前序） 以及以树的方式显示二对树的各个结点。-Program Descr iption: The tree of some common operations of the package, including the query, insert, delete, traversing a binary tree (in order, postorder, preorder), and the tree dis
ThreeOrder
- 本代码用于求二叉树的前、中、后序遍历序列，可以自定义二叉树的保存形式，比较方便快捷。-Find before, during and after the traversal sequence of the binary tree
Tree
- 基于java的生成二叉树程序。可进行前序遍历、中序遍历、后序遍历-Java program based on the generation of binary tree. Can be pre-order traversal, inorder traversal, postorder traversal
BinaryTree
- 二叉树的定义和前序，中序，后序，层次遍历。包括递归的写法和非递归的写法。附有部分注释！-The definition of a binary tree and preamble, inorder, postorder, level traversal. Including wording of recursive and non-recursive written. With some notes!
tree
- 用JAVA构造的一颗简单的二叉树，并实现它的中序、前序、后序遍历。-JAVA constructed a simple binary tree, and its inorder, preorder, postorder traversal.
complete-binary-tree--traversal
- 完全二叉树的前序、中序、后序、层次遍历 使用JAVA实现 精确简洁 使用最小的空间实现最全的功能-Complete binary tree before order, in sequence, after the level traversal using JAVA achieve accurate and simple to use minimal space to achieve the most complete functionality
binary-tree
- 二叉树的基本功能：1.生成一棵以二叉链表存储的二叉树bt (节点树可自定义)2.用递归方法前序、中序、后序遍历bt，并以缩格形式打印bt上各结点的信息3.交换bt上的所有左右子树，并以缩格形式打印出交换前-The basic function of a binary tree: a tree in order to generate a list stored in binary binary bt (node tree can be customized) 2 be
java
- java编写二叉树，以及实现了二叉树的前序中序后序遍历(Achieve two binary tree preorder, in order, after traversal)