Teaching a complex process: Insertion in red black trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9112, Issue , 2015, Pages 698-701

  Liew, C W ^a   Xhakaj, F ^a  

^a LAFAYETTE COLLEGE   (United States)

Author keywords

Computer science; Data structures; Learning process

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; DATA STRUCTURES;

BALANCED TREES; COMPLEX PROCESSES; EXAMPLE-TRACING TUTORS; LEARNING PROCESS; NEW APPROACHES; RED BLACK TREE;

TEACHING;

EID: 84949008322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-19773-9_95     Document Type: Conference Paper

References (5)

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. 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)
3. Galles, D.: Data structure visualizations. http://www.cs.usfca.edu/galles/visualization
4. Ha, S.: VisuAlgo. http://www.comp.nus.edu.sg/stevenha/visualization
5. Weiss, M.A.: Data Structures & Problem Solving Using Java, 3rd ed. Pearson Education Inc. (2011)