| 二叉树的静态二叉链表存储 |
| |
| 引用本文： | 索红军.二叉树的静态二叉链表存储[J].渭南师范学院学报,2008,23(2):66-67. |
| |
| 作者姓名： | 索红军 |
| |
| 作者单位： | 西安电子科技大学,计算机学院,西安,710071;渭南师范学院,计算机科学系,陕西,渭南,714000 |
| |
| 摘 要： | 目前,对二叉树存储结构主要有顺序存储结构和链式存储结构（二叉链表）两种.其中链式存储结构比较常用.为了简化对二叉树的遍历、线索化等有关操作的具体实现过程,提出改进的顺序存储结构——静态二叉链表.
|
| 关 键 词： | 二叉树 存储结构 改进 |
| 文章编号： | 1009-5128(2008)02-0066-02 |
| 修稿时间： | 2007年5月27日 |
Static Linked Representation of Binary Tree |
| |
| SUO Hong-jun.Static Linked Representation of Binary Tree[J].Journal of Weinan Teachers College,2008,23(2):66-67. |
| |
| Authors: | SUO Hong-jun |
| |
| Institution: | SUO Hong-jun (1 School of Computer Science and Technology, Xidian University, Xi＇an 710071, China; 2 Department of Computer Science, Weinan Teachers University, Weinan 714000, China) |
| |
| Abstract: | At present, there have two representations of binary tree. They are array representation and linked representation. The linked representation is wide used in program. On account of the operation of traversing binary tree and threading binary tree, we bring out an improved representation of binary tree, static linked representation to simplify the correlative algorithm. |
| |
| Keywords: | binary tree representation improvement |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
