Watch the Amazon Original series Cross now on Prime Video. Yours with Prime.
Buy used:
$6.70
FREE delivery December 13 - 18. Details
Or fastest delivery December 12 - 16. Details
Used: Very Good | Details
Sold by ThriftBooks-Phoenix
Condition: Used: Very Good
Comment: May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less
Access codes and supplements are not guaranteed with used items.
Kindle app logo image

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.

Read instantly on your browser with Kindle for Web.

Using your mobile phone camera - scan the code below and download the Kindle app.

QR code to download the Kindle App

Follow the author

Thomas A. Standish
Follow
Something went wrong. Please try your request again later.

Data Structure Techniques

by Thomas A. Standish (Author)
5.0 5.0 out of 5 stars 4 ratings
See all formats and editions
This book is about the creation and analysis of efficient data structures. It covers: the primitive node structure; asymptotic notation for mathematically discussing performance characteristics; built-in arrays; list structures built from either nodes or arrays; iterators as an abstract model of enumerating the items in a sequence; stacks and queues for computing with last-in/first-out and first-in/first-out orderings; binary and general tree structures for searching or representing hierarchical relationships; min and max heaps for representing ordering based on priorities; graph structures for representing more general relationships between data elements; hash tables for the efficient retrieval of strings and other objects; and finally trade-offs between the structures, and strategies for picking the most appropriate ones. To understand the material in this book you should be comfortable enough in a programming language to be able to work with and write your own variables, arithmetic expressions, if-else conditions, loops, subroutines (also known as functions), pointers (also known as references or object handles), structures (also known as records or classes), simple input and output, and simple recursion. Because many different languages approach the construction of data structures differently, we use pseudo-code so that you can translate the code into your own language.
Previous slide of product details
  1. ISBN-10
    0201072564
  2. ISBN-13
    978-0201072563
  3. Publisher
    Addison-Wesley
  4. Publication date
    January 1, 1980
  5. Language
    English
  6. Print length
    447 pages
  7. See all details
Next slide of product details

Product details

  • Publisher ‏ : ‎ Addison-Wesley (January 1, 1980)
  • Language ‏ : ‎ English
  • Hardcover ‏ : ‎ 447 pages
  • ISBN-10 ‏ : ‎ 0201072564
  • ISBN-13 ‏ : ‎ 978-0201072563
  • Item Weight ‏ : ‎ 1.1 pounds
  • Customer Reviews:
    5.0 5.0 out of 5 stars 4 ratings

About the author

Follow authors to get new release updates, plus improved recommendations.
Thomas A. Standish

Thomas A. Standish

Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

Discover more of the author’s books, see similar authors, read book recommendations and more.

Customer reviews

5 out of 5 stars
4 global ratings

Top reviews from the United States

Gregory S
5.0 out of 5 stars Dat Structure Techniques
Reviewed in the United States on January 7, 2014
Verified Purchase
This classical data structures book is old and out of date, but it still has the mathematical concepts that many computer science students find puzzling. If you can find a copy of the book, buy it.
2 people found this helpful
Helpful
 Report