DeepRead
Cover of Data Structures Using C

Data Structures Using C

Aaron M. Tenenbaum · 1990

Programming and computer science › Algorithms and coding interviews

#14,749 most recommended

About the book

A textbook on data structures and the algorithms that operate on them, with implementations written in C. It covers arrays, linked lists, stacks, queues, trees, graphs, sorting, searching, and hashing, and it is aimed at undergraduate computer science courses. The book holds that a data structure should be chosen by the operations it must support and by the time and space each operation costs, and that these costs are best compared using asymptotic analysis. It presents pointers, dynamic memory, and recursion as the main tools for building structures in C. It also treats the implementations as concrete examples of the trade-offs between alternatives such as array-based and linked representations.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

0242010201520212010 peak · 1
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 34 want to read
  • 4 reading
  • 1 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1990
ISBN
9780131997462
Editions known
4 at Open Library
Open Library
OL4798785W

C (Computer program language)Data structures (Computer science)

Explore in the mosaic

Read next: its neighbours on the mosaic