Abstract
Red black trees (and all balanced trees) are an important concept in computer science with many applications. This paper describes a new approach using an example tracing tutor and our experince in using it to teach insertion in red black trees.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
ACM/IEEE-CS Joint Task Force on Computing Curricula. ACM/IEEE Computing Curricula 2001 Final Report (2001). http://www.acm.org/sigcse/cc2001
Aleven, V., McLaren, B.M., Sewall, J., Koedinger, K.R.: A new paradigm for intelligent tutoring systems: Example-tracing tutors. International Journal of Artificial Intelligence in Education 19(2), 105–154 (2009)
Galles, D.: Data structure visualizations. http://www.cs.usfca.edu/ galles/visualization
Ha, S.: VisuAlgo. http://www.comp.nus.edu.sg/stevenha/visualization
Weiss, M.A.: Data Structures & Problem Solving Using Java, 3rd ed. Pearson Education Inc. (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Liew, C.W., Xhakaj, F. (2015). Teaching a Complex Process: Insertion in Red Black Trees. In: Conati, C., Heffernan, N., Mitrovic, A., Verdejo, M. (eds) Artificial Intelligence in Education. AIED 2015. Lecture Notes in Computer Science(), vol 9112. Springer, Cham. https://doi.org/10.1007/978-3-319-19773-9_95
Download citation
DOI: https://doi.org/10.1007/978-3-319-19773-9_95
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19772-2
Online ISBN: 978-3-319-19773-9
eBook Packages: Computer ScienceComputer Science (R0)