二叉树构造算法详解与教学设计  

Implementation of Algorithms of Binary Trees and Its Teaching-Design

作　　者：平安 PING An(School of Statics and Mathematics,Yunnan University of Finance and Economics,Kunming Yunnan 650221,China)

机构地区：[1]云南财经大学统计与数学学院,云南昆明650221

出　　处：《玉溪师范学院学报》2021年第6期17-21,共5页Journal of Yuxi Normal University

摘　　要：当前使用的数据结构教材有大量涉及二叉树的算法,但鲜有提及如何构造二叉树.数据结构的学习是基于实验的,对学生而言,无法构造二叉树,也就无法完成关于二叉树的算法实验.为此,教学中有必要在介绍二叉树构造的原理及伪代码的基础上,针对基于实验的教学提出新的设计方案.Although algorithms of binary trees are introduced in many textbooks on data structure,how to implement a binary tree is seldom discussed.The learning of data structure is based on experiment.Students cannot do the corresponding experiment if they cannot construct a binary tree.This paper introduces the principle and pseudo-code of binary tree construction,and puts forward the teaching design scheme based on experiment.

关 键 词：数据结构 二叉树构造 二叉树遍历 教学设计 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]