Alternatives to two classic data structures

Authors:
Chris Okasaki
Affiliations:
United States Military Academy, West Point, NY
Venue:
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Year:
2005

Citing 6
Cited 0

Weight-biased leftist trees and modified skip lists

Journal of Experimental Algorithmics (JEA)
Data Structures and Algorithm Analysis in Java

Data Structures and Algorithm Analysis in Java
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
Introduction to Algorithms

Introduction to Algorithms
Linear lists and priority queues as balanced binary trees

Linear lists and priority queues as balanced binary trees
Red-black trees in a functional setting

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

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.