Alternatives to two classic data structures

Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives to these two data structures that may offer pedagogical advantages for typical students. Categories and Subject Descriptors E.1 [Data Structures]: Trees General Terms Algorithms Keywords Red-black trees, maxiphobic heaps, leftist heaps

• Type: Conference
• Year: 2005
• Where: SIGCSE
• Authors: Chris Okasaki
• Keywords: Data Structures, Education, Leftist Heaps, Red-black Trees, SIGCSE 2005