摘要
提出用可视化法建立二叉树实例的概念 ,并借用满二叉树顺序存储的特殊性来实现可视化 。
In this paper,we propose a concept that a binary tree example is built by a visual method. We complete the method by the special sequential storage structure of full binary tree,and finally solve some visual questions.
出处
《计算机应用研究》
CSCD
北大核心
2001年第9期56-58,共3页
Application Research of Computers
关键词
数据结构
可视化法
二叉树
计算机
Visualization
True Binary Tree
Virtual Binary Tree
Binary Tree Example
True Node
Virtual Node
Example Node
