Open data structures : : an introduction / / Pat Morin.
Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Analyzed and implemented in Java, with a...
Saved in:
Superior document: | OPEL (Open Paths to Enriched Learning) |
---|---|
VerfasserIn: | |
Place / Publishing House: | Edmonton, Alberta : : AU Press,, 2013. ©2013 |
Year of Publication: | 2013 |
Edition: | 31th ed. |
Language: | English |
Series: | Open paths to enriched learning.
|
Physical Description: | 1 online resource (337 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Introduction
- Array-based lists
- Linked lists
- Skiplists
- Hash tables
- Binary trees
- Random binary search trees
- Scapegoat trees
- Red-black trees
- Heaps
- Sorting algorithms
- Graphs
- Data structures for integers
- External memory searching.