Alternatives to two classic data structures
No Thumbnail Available
Authors
Okasaki, Chris
Issue Date
2005-02-23
Type
proceedings-article
Language
Keywords
Classic data structure
Alternative Title
Abstract
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.
Description
Citation
Chris Okasaki. 2005. Alternatives to two classic data structures. In Proceedings of the 36th SIGCSE technical symposium on Computer science education (SIGCSE '05). Association for Computing Machinery, New York, NY, USA, 162–165. https://doi.org/10.1145/1047344.1047407
Publisher
ACM