Data Structures Using C and C ++
Langsam Yedidyah
Data Structures Using C and C ++ english Yedidyah Langsam, Moshe J. Augustein, et.al - 2nd ed 1995 - India PHI - iii-670 p. ; soft bound 17.5 *23.7 cm
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
Recursion
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++
Trees
Binary trees
Binary tree representations
Example: The Huffman algorithm
Representing lists as binary trees
Trees and their applications
Example: Game trees
Sorting
General background
Exchange sorts
Selection and tree sorting
Insertion sorts
Merge and radix sorts
Searching
Basic search techniques
Tree searching
General search trees
Hashing
Graphs and their applications
Graphs
A flow problem
Linked representation of graphs
Graph traversal and spanning forests
Storage management
General lists
Automatic list management
Dynamic memory management
978-81-203-1177-0
005.73 / LAN
Data Structures Using C and C ++ english Yedidyah Langsam, Moshe J. Augustein, et.al - 2nd ed 1995 - India PHI - iii-670 p. ; soft bound 17.5 *23.7 cm
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
Recursion
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++
Trees
Binary trees
Binary tree representations
Example: The Huffman algorithm
Representing lists as binary trees
Trees and their applications
Example: Game trees
Sorting
General background
Exchange sorts
Selection and tree sorting
Insertion sorts
Merge and radix sorts
Searching
Basic search techniques
Tree searching
General search trees
Hashing
Graphs and their applications
Graphs
A flow problem
Linked representation of graphs
Graph traversal and spanning forests
Storage management
General lists
Automatic list management
Dynamic memory management
978-81-203-1177-0
005.73 / LAN