Data Structures and Efficient Algorithms in Mathematica

download notebookDownload this example as a Mathematica notebook.


Daniel Lichtblau
Wolfram Research, Inc.
October, 1999


Abstract

Initialization

Introduction

Tables (lists)

Sparse arrays (hash tables)

Stacks

Queues

Trees

Bitvectors

Tree application: A rudimentary parser