搜索资源列表
erchashubianli
- 数据结构中二叉树遍历算法，用C++写的，我们的作业，老师验收通过。-Binary tree data structure traversal algorithm, using C++ Written, our operations, acceptance, through the teacher.
erchashubianli
- 此程序为c语言编写，可以实现二叉树的先，中，后遍历-This procedure for the c language, the first binary tree can be achieved, during and after the traversal
erchashubianli
- 二叉树遍历问题是重要的问题。程序的实现简单而方便。-erchashu
erchashubianli
- 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。将一棵二叉树的所有左右子树进行交换的算法。-Prepared using binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. Will be a
erchashubianli
- 二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of
erchashubianli
- 实现对二叉树的各种遍历 有先序遍历 中序遍历 后序遍历 -Achieve a variety of traversing a binary tree traversal in preorder traversal sequence after traversing
erchashubianli
- 以二叉链表为存储结构，实现二叉树的创建、前序、中序和后序遍历(非递归遍历)-The list is stored in binary structure, to achieve the creation of a binary tree, the first order, the order and post order traversal (non-recursive traversal)
erchashubianli
- 实现二叉树的建立和先、中、后序遍历二叉树以及求二叉树深度的功能。-To achieve the establishment and the first binary tree, during, and after traversing a binary tree and binary tree find the depth of functionality.
erchashubianli
- 实现二叉树的遍历，用C++实现，字数还没到啊-To achieve binary tree traversal, using C++ implementation, words not to ah. . .
erchashubianli
- 二叉树的遍历，适用于VC环境 是一个基本的源代码-just for VC environment
erchashubianli
- 本科生阶段或者研究生阶段软件技术基础课程中有关二叉树遍历的程序-Binary tree traversal program in the undergraduate stage or graduate level software technology foundation courses
erchashubianli
- 二叉树中序遍历递归算法演示，用图形描绘了是怎么用递归算法遍历二叉树，很形象直观。-Binary tree Recursion algorithm
erchashubianli
- 二叉树遍历-Binary Tree Traversal
erchashubianli
- 二叉树遍历，实现二叉树的遍历，有中序遍历，前序遍历，后序遍历三种-Binary tree traversal, binary tree traversal, the traversal, preorder traversal, after the traversal of three
erchashubianli
- 能够以广义表输入一个二叉树，并能对其进行前序遍历，中序遍历，后序遍历，层次遍历。-Generalized list, enter a binary tree, and its preorder traversal, in order traversal post-order traversal, traverse the level.
c-erchashubianli
- 建立一棵二叉树，并对其进行遍历（先序、中序、后序），打印输出遍历结果。-Create a binary tree, and traverse the results of its traversal (preorder, inorder, postorder), print output.
erchashubianli
- 包含先序遍历、中序遍历、后序遍历，不可错过的中国好代码-Contains preorder, preorder, postorder, not to be missed China good code
erchashubianli
- 二叉树的遍历和操作 计算机软件基础-Two binary tree traversal and operating computer software foundation
erchashubianli
- 对所建立的二叉树用递归和非递归的中序遍历输出树的结点的算法。-Established algorithm for binary output node of the tree using recursive and non-recursive preorder.
erchashubianli
- 二叉树遍历，先建立二叉树，然后遍历寻找指定节点，输出反向路径-Binary tree traversal, first create a binary tree, then traverse to find the specified node, output reverse path