顺序存储二叉树的遍历及其应用研究

摘要

The sequence storage binary tree is used to dispose that binary tree form hard upon full .This the-sis introduced binary tree structure of sequence storage and it's advantage, the traversal method, level traversal algorithm and recursive traversal algorithm of sequence binary tree , and some simple application on level travers-al algorithm.%　　顺序存储二叉树非常适用于二叉树的树形接近于满二叉树时的处理。本文介绍了二叉树的顺序存储结构及其优点、二叉树的遍历方法、顺序存储二叉树的层次遍历和递归遍历算法，以及层次遍历算法的一些简单应用。