Fundamentals of Data Structures in C. Este artículo no está disponible.
Horowitz, Ellis, Sahni, Sartaj, Anderson-Freed, Susan
26 valoraciones de Goodreads
Idioma: inglés
Editorial: W. H. Freeman, 1992
- Tapa dura
- Usado
Vendedor patrimonial
Librería: Wonder Book, Frederick, MD, Estados Unidos de AmericaWonder Book
Vendedor de 5 estrellas
Vendedor de AbeBooks desde 1 de noviembre de 1997
Miembro de asociación: ABAAILAB
Ver los artículos de este vendedorNo disponible
Tapa dura
Condición: Usado - Aceptable
EUR 7,38
Descripción del artículo del vendedor
Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains.
N° de ref. del artículo Z09A-03251
- Título
- Fundamentals of Data Structures in C
- Autor
- Horowitz, Ellis, Sahni, Sartaj, Anderson-Freed, Susan
- Editorial
- W. H. Freeman
- Año de publicación
- 1992
- Estado
- Good
- Encuadernación
- Encuadernación de tapa dura
- Idioma
- inglés
- ISBN 10
- 0716782502
- ISBN 13
- 9780716782506
Designed to function as a textbook or as a professional reference, "Fundamentals of Data Structures in C" provides in-depth coverage of all aspects of data structure implementation in ANSI C. The book goes beyond the standard fare of stacks, queues, and lists to offer such features as afull chapter on search structures and a discussion of advanced tree structures. Recent data structure innovations rarelv found in other texts are presented, including Fibonacci Heaps, Splay Trees, Red-Black Trees, 2-3 Trees, 2-3-4 Trees, Leftist Trees, Binokcal Heaps, Min-Max Heaps, and Deaps.
“Sinopsis” puede pertenecer a otra edición de este título.
Reseña del editor
Designed to function as a textbook or as a professional reference, "Fundamentals of Data Structures in C" provides in-depth coverage of all aspects of data structure implementation in ANSI C. The book goes beyond the standard fare of stacks, queues, and lists to offer such features as afull chapter on search structures and a discussion of advanced tree structures. Recent data structure innovations rarelv found in other texts are presented, including Fibonacci Heaps, Splay Trees, Red-Black Trees, 2-3 Trees, 2-3-4 Trees, Leftist Trees, Binokcal Heaps, Min-Max Heaps, and Deaps.
“Acerca de” puede pertenecer a otra edición de este título.