二叉树结构的输出

Output of the Binary Tree Structure

二叉树是一种重要的数据结构，广泛运用于计算机软件技术中。本文主要研究了二叉树结构的输出，并提出了３种输出方法。前两种方法均在标准ＰＡＳＣＡＬ中实现，未使用标准库函数；第三种方法调用了标准ＣＲＴ、ＤＯＳ单元，运用清屏、光标定位、延迟等函数，使输出不受行宽和换行限制，可直接访问节点定位输出。对深度超过６，需超行输出的。

Binary tree is an important type of data sturcture.It is extensively applies in the technology of computer software.This paper discusses output of the binary tree structure,and puts forward three algorithms.The first two algorithms are executed in standard pascal language with noutilization of functions.In the third algorithm,with the utilization of functions:Clrscr、Goto()、Delay()…,the output of the binary tree structure becomes free.