Title
Fundamentals Of Data Structures In C
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
Designed To Function As A Textbook Or As A Professional Reference, Fundamentals Of Data Structures In C Provides Indepth 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, Redblack Trees, 23 Trees, 234 Trees, Leftist Trees, Binokcal Heaps, Minmax Heaps, And Deaps.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: How many pages does this book have? A: This book has five hundred eighty-five pages. It covers a comprehensive range of topics in data structures.
- Q: What is the binding type of this book? A: The binding type is hardcover. This provides durability and a professional look, making it suitable for both students and professionals.
- Q: What are the dimensions of this book? A: The dimensions are approximately seven point seven six inches in length, one point two six inches in width, and nine point seven six inches in height. These measurements make it portable and easy to handle.
- Q: Who is the author of this book? A: The author is Ellis Horowitz. He is a well-known figure in computer science education, contributing significantly to the field.
- Q: What topics are covered in this book? A: The book covers a wide range of data structure topics, including advanced tree structures and search structures. It also introduces recent innovations like Fibonacci Heaps and Red-Black Trees.
- Q: Is this book suitable for beginners? A: Yes, this book is suitable for beginners as well as advanced learners. It serves both as a textbook and a professional reference.
- Q: Can I use this book for self-study? A: Yes, this book is ideal for self-study. It provides detailed explanations and examples that help learners grasp complex concepts.
- Q: What level of programming knowledge is required to understand this book? A: A basic understanding of programming concepts is recommended. Familiarity with ANSI C will enhance comprehension of the material.
- Q: Are there exercises or problems to solve in this book? A: Yes, the book includes exercises and problems to reinforce learning. These help readers apply the concepts discussed in each chapter.
- Q: How do I care for this hardcover book? A: To care for this hardcover book, keep it in a dry place and avoid exposing it to direct sunlight. This will help maintain its condition.
- Q: Is this book safe for children? A: Yes, the content of this book is educational and appropriate for older children interested in computer science. However, parental guidance is recommended.
- Q: What if the book arrives damaged? A: If the book arrives damaged, you should contact the seller for a return or exchange. They typically have a policy in place for such situations.
- Q: How can I store this book to prevent damage? A: To prevent damage, store this book upright in a cool, dry area away from moisture. Avoid stacking heavy items on top.
- Q: Does this book include references or additional resources? A: Yes, the book includes references and suggested readings. This helps readers explore topics further and gain a deeper understanding.
- Q: What makes this book different from other data structure books? A: This book offers in-depth coverage of advanced data structures rarely found in other texts, such as Fibonacci Heaps and Splay Trees. Its comprehensive approach sets it apart.
- Q: Is this book used in academic courses? A: Yes, this book is often used in academic courses for computer science. It is recognized for its thorough treatment of data structures.