| 两种二叉树深度求解非递归算法的实现 |
| |
| 引用本文： | 唐宁九,孙界平.两种二叉树深度求解非递归算法的实现[J].四川大学学报(自然科学版),1996,33(3):259-261. |
| |
| 作者姓名： | 唐宁九 孙界平 |
| |
| 摘 要： | 二叉树深度求解是一个有多解的问题，从算法的时间复杂度和空间复杂度着眼，采用追踪栈顶指针，层次遍历的两种算法实现二叉树深度的求解，并对算法进行了分析和比较。
|
| 关 键 词： | 二叉树深度 非递归 遍历算法 |
THE IMPLEMENTATION AND ANALYSIS ON NON-RECURSIVE ALGORITHMS FOR GETTING THE DEPTH OF BINARY TREE |
| |
| Tang Ningjiu, Sun Jieping, Gong Rongwu, Li Lei.THE IMPLEMENTATION AND ANALYSIS ON NON-RECURSIVE ALGORITHMS FOR GETTING THE DEPTH OF BINARY TREE[J].Journal of Sichuan University (Natural Science Edition),1996,33(3):259-261. |
| |
| Authors: | Tang Ningjiu Sun Jieping Gong Rongwu Li Lei |
| |
| Institution: | Department of Computer Science |
| |
| Abstract: | Getting the depth of binary tree has various solution. Based on the cosideration of view of the time complexity and space complexity for algorithms, two non-recursive algrithms for getting the depth of binary tree are obtained by tracing the top pointer of stack and level traversal. |
| |
| Keywords: | depth of binary tree non-recursive traversal algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
