| 一种新的二叉树生成办法 |
| |
| 引用本文： | 张彦军,王晓明,姚国祥.一种新的二叉树生成办法[J].佳木斯大学学报,2005,23(4):515-517. |
| |
| 作者姓名： | 张彦军 王晓明 姚国祥 |
| |
| 作者单位： | [1]暨南大学信息网络工程研究中心,广州 510632 [2]暨南大学计算机系,广州 510632 |
| |
| 摘 要： | 通过实例阐述了二叉树的遍历与二叉排序树之间的联系,利用此联系给出了快速准确生成二叉树的方法,并对该方法加以了证明.
|
| 关 键 词： | 二叉树遍历 二叉排序树 二叉树生成方法 |
| 文章编号： | 1008-1402（2005）04-0515-03 |
| 收稿时间： | 2005-07-17 |
| 修稿时间： | 2005年7月17日 |
A New Method of Forming the Binary Tree |
| |
| ZHANG Yan-jun,WANG Xiao-ming,YAO Guo-xiang.A New Method of Forming the Binary Tree[J].Journal of Jiamusi University(Natural Science Edition),2005,23(4):515-517. |
| |
| Authors: | ZHANG Yan-jun WANG Xiao-ming YAO Guo-xiang |
| |
| Institution: | ZHANG Yan-jun~1,WANG Xiao-ming~2,YAO Guo-xiang~1 |
| |
| Abstract: | We expatiate on the relationship between the binary tree and binary sort tree through an instance, and present a method to form the binary tree fast and accurately based on the relationship between the binary tree and binary sort tree. Furthermore, we prove that the method is fight in theory. |
| |
| Keywords: | traversing of a binary tree binary sort tree method of forming binary tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
