Front cover image for Data structures using C and C++

Data structures using C and C++

This introduction to the fundamentals of data structures explores abstract concepts, considers how those concepts are useful in problem-solving, explains how the abstractions can be made concrete by using a programming language, and shows how to use the C language for advanced programming and how to develop the advanced features of C++.
Print Book, English, ©1996
Prentice Hall, Upper Saddle River, N.J., ©1996
xvi, 672 pages : illustrations ; 24 cm
9780130369970, 0130369977
Introduction to data structures
Information and meaning
Arrays in C
Structures in C
Classes in C++
The stack
Definition and examples
Representing stacks in C
Example: Infix, postfix, and prefix
Recursive definition and processes
Recursion in C
Writing recursive programs
Simulating recursion
Efficiency of recursion
Queues and lists
The queue and its sequential representation
Linked lists
Lists in C
Example: Simulation using linked lists
Other list structures
The linked list in C++
Binary trees
Binary tree representations
Example: The Huffman algorithm
Representing lists as binary trees
Trees and their applications
Example: Game trees
General background
Exchange sorts
Selection and tree sorting
Insertion sorts
Merge and radix sorts
Basic search techniques
Tree searching
General search trees
Graphs and their applications
A flow problem
Linked representation of graphs
Graph traversal and spanning forests
Storage management
General lists
Automatic list management
Dynamic memory management
Revised edition of: Data structures using C / Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augenstein. c1990