Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

SIGCSE
2005
ACM

favoriteEmaildiscussreport

217views Education» more SIGCSE 2005»

Alternatives to two classic data structures

13 years 10 months ago

Alternatives to two classic data structures

Download www.eecs.usma.edu

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 oﬀer 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

Chris Okasaki

Real-time Traffic

Data Structures | Education | Leftist Heaps | Red-black Trees | SIGCSE 2005 |

claim paper

Related Content

» Alternate Representation of Distance Matrices for Characterization of Protein Structure

» A Fun Application of Compact Data Structures to Indexing Geographic Data

» The Impact of Data Transfer and Buffering Alternatives on Network Interface Design

» Semisupervised sparse metric learning using alternating linearization optimization

» Reconciling two models of multihierarchical markup

» Weak Visibility of Two Objects in Planar Polygonal Scenes

» NeatMap nonclustering heat map alternatives in R

» The power of two minhashes for similarity search among hierarchical data objects

» Two heads better than one pattern discovery in timeevolving multiaspect data

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	SIGCSE
Authors	Chris Okasaki

Comments (0)