ABSTRACT Background and Context Recursion in binary trees has proven to be a hard topic. There was not much research on enhancing student understanding of this topic. Objective We present a tutorial to enhance learning through practice of recursive operations in binary trees, as it is typically taught post-CS2. Method We identified the misconceptions students have in recursive operations on binary trees. We designed a code writing exam question to measure those misconceptions. We built a tutorial that trains students on avoiding those misconceptions through the use of a semantic code analyzer that detects misconceptions and provides appropriate feedback. Findings Our results show an improvement in student performance when using the tutorial along with the practice exercises, and even more improvement when the same exercises are used with a semantic code analyzer. Implications The best way to use our tutorial to enhance student performance on advanced recursion is to allow students solving the tutorial exercises with the the semantic feedback.

中文翻译：

---

BTRecurTutor：二叉树递归练习教程

摘要 二叉树中的背景和上下文递归已被证明是一个难题。关于提高学生对这一主题的理解的研究并不多。目标 我们提供了一个教程，通过在二叉树中练习递归操作来增强学习，因为它通常是在 CS2 之后教授的。方法 我们找出了学生对二叉树递归操作的误解。我们设计了一个代码编写考试问题来衡量这些误解。我们构建了一个教程，通过使用语义代码分析器检测误解并提供适当的反馈，训练学生避免这些误解。结果我们的结果表明，在使用教程和练习练习时，学生的表现有所提高，当相同的练习与语义代码分析器一起使用时，甚至会有更多的改进。含义 使用我们的教程来提高学生在高级递归方面的表现的最佳方法是让学生使用语义反馈解决教程练习。