Teaching a Complex Process: Insertion in Red Black Trees

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9112)

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.

Keywords

Computer science Data structures Learning process 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    ACM/IEEE-CS Joint Task Force on Computing Curricula. ACM/IEEE Computing Curricula 2001 Final Report (2001). http://www.acm.org/sigcse/cc2001
  2. 2.
    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)Google Scholar
  3. 3.
    Galles, D.: Data structure visualizations. http://www.cs.usfca.edu/ galles/visualization
  4. 4.
  5. 5.
    Weiss, M.A.: Data Structures & Problem Solving Using Java, 3rd ed. Pearson Education Inc. (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceLafayette CollegeEastonUSA

Personalised recommendations