Location:
Search - 线索化二叉树遍历算法
Search list
Description:
遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化.
-traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.
Platform: |
Size: 132632 |
Author: 03500218 |
Hits:
Description: 熟练掌握二叉树的二叉链表表示及前序创建算法与实现；
2）熟练掌握二叉树的前序、中序和后序递归遍历算法与实现；
3）掌握中序遍历线索二叉树的基本算法与实现
4）掌握中序遍历线索化二叉树的算法与实现；
5）按照实验题目要求独立完成实验内容（提交程序清单及相关实验数据与运行结果）；
6）认真书写实验报告,并按时提交。
Platform: |
Size: 19967 |
Author: 川原 |
Hits:
Description: 1)熟练掌握二叉树的二叉链表表示及前序创建算法与实现；
2）熟练掌握二叉树的前序、中序和后序递归遍历算法与实现；
3）掌握中序遍历线索二叉树的基本算法与实现
4）掌握中序遍历线索化二叉树的算法与实现
Platform: |
Size: 27978 |
Author: huiyuanyuan |
Hits:
Description: 二叉树的遍历、线索化、遍历线索化二叉树等算法；深度搜索优先、广度搜索优先算法，
最小生成树、最短路算法。
Platform: |
Size: 314438 |
Author: 刘飞 |
Hits:
Description: 本程序的主要功能在于先序输入一个二叉树,用三种递归,三种非递归进行遍历,并进行中序线索化以及其遍历,后进行中序去线索化,再进行后序线索化以及其遍历,最后后序去线索花进行中序遍历.程序的基本目的是了解二叉树的基本操作.
Platform: |
Size: 2803 |
Author: red_eyed_hare |
Hits:
Description:
遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化.
-traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.
Platform: |
Size: 161792 |
Author: 03500218 |
Hits:
Description: 熟练掌握二叉树的二叉链表表示及前序创建算法与实现；
2）熟练掌握二叉树的前序、中序和后序递归遍历算法与实现；
3）掌握中序遍历线索二叉树的基本算法与实现
4）掌握中序遍历线索化二叉树的算法与实现；
5）按照实验题目要求独立完成实验内容（提交程序清单及相关实验数据与运行结果）；
6）认真书写实验报告,并按时提交。
-Master Binary tree list and the former express order to create algorithms and realize 2) proficiency in the first tree order, in sequence and post-order recursive traversal algorithm and realization 3) grasp the traversal clues to the basic binary tree algorithm and realization of 4) have a good clue of binary tree traversal algorithms and implementation 5) in accordance with the requirements of the experiment the subject independently completed the experiment content (to submit the list of procedures and related experimental data and results) 6 ) seriously write experimental reports, and submitted on time.
Platform: |
Size: 19456 |
Author: 川原 |
Hits:
Description: 1)熟练掌握二叉树的二叉链表表示及前序创建算法与实现；
2）熟练掌握二叉树的前序、中序和后序递归遍历算法与实现；
3）掌握中序遍历线索二叉树的基本算法与实现
4）掌握中序遍历线索化二叉树的算法与实现
-1) The master of the binary tree list and the former express order to create algorithms and realize 2) proficiency in the first tree order, in sequence and post-order recursive traversal algorithm and realization 3) in order to master clues to the basic binary tree traversal algorithm and realization of 4) have a good clue of binary tree traversal algorithms and realize
Platform: |
Size: 27648 |
Author: huiyuanyuan |
Hits:
Description: 二叉树的遍历、线索化、遍历线索化二叉树等算法；深度搜索优先、广度搜索优先算法，
最小生成树、最短路算法。-Binary tree traversal, threaded, threaded binary tree traversal algorithms, such as the depth of the search priority, breadth of search priority algorithm, minimum spanning tree, shortest path algorithm.
Platform: |
Size: 314368 |
Author: 刘飞 |
Hits:
Description: 各种算法的flash演示（一共45个：B树的删除、生长过程，单链表结点的插入、删除，二叉排序树的生成、删除，构造哈夫曼树的算法模拟、克鲁斯卡尔算法构造最小生成树、邻接表表示的图的广度优先遍历、寻找中序线索化二叉树指定结点的后继......）-The flash demo of various algorithms (a total of 45: B tree removal, growth process, a single linked list node insert, delete, binary sort tree generation, deletion, Huffman tree construction algorithm simulation, Kruskal construct minimum spanning tree algorithm, adjacency list that breadth-first traversal of the graph to find clues to the sequence of binary tree nodes designated successor ......)
Platform: |
Size: 964608 |
Author: |
Hits: