Title
Data Structure Techniques,Used
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
This Book Is About The Creation And Analysis Of Efficient Data Structures. It Covers: The Primitive Node Structure; Asymptotic Notation For Mathematically Discussing Performance Characteristics; Builtin Arrays; List Structures Built From Either Nodes Or Arrays; Iterators As An Abstract Model Of Enumerating The Items In A Sequence; Stacks And Queues For Computing With Lastin/Firstout And Firstin/Firstout Orderings; Binary And General Tree Structures For Searching Or Representing Hierarchical Relationships; Min And Max Heaps For Representing Ordering Based On Priorities; Graph Structures For Representing More General Relationships Between Data Elements; Hash Tables For The Efficient Retrieval Of Strings And Other Objects; And Finally Tradeoffs Between The Structures, And Strategies For Picking The Most Appropriate Ones. To Understand The Material In This Book You Should Be Comfortable Enough In A Programming Language To Be Able To Work With And Write Your Own Variables, Arithmetic Expressions, Ifelse Conditions, Loops, Subroutines (Also Known As Functions), Pointers (Also Known As References Or Object Handles), Structures (Also Known As Records Or Classes), Simple Input And Output, And Simple Recursion. Because Many Different Languages Approach The Construction Of Data Structures Differently, We Use Pseudocode So That You Can Translate The Code Into Your Own Language.
⚠️ 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 contains four hundred forty-seven pages. It provides in-depth coverage of data structures and their analysis.
- Q: What type of binding does this book have? A: This book is bound in hardcover. Hardcover binding ensures durability and long-lasting use.
- Q: Who is the author of 'Data Structure Techniques'? A: The author of this book is Thomas A. Standish. He presents complex concepts in an accessible manner.
- Q: What programming knowledge do I need to understand this book? A: You should be comfortable with programming basics. This includes variables, loops, and functions to follow along.
- Q: What topics are covered in this book? A: This book covers a wide range of data structure topics. It includes arrays, trees, heaps, and graph structures.
- Q: Is this book suitable for beginners? A: Yes, this book is suitable for beginners with basic programming knowledge. It explains concepts using pseudo-code for easy understanding.
- Q: Can I use this book for advanced data structure studies? A: Yes, this book is also beneficial for advanced studies. It discusses trade-offs and strategies for selecting data structures.
- Q: Is there a glossary or index in this book? A: Yes, the book includes an index. This helps readers easily locate specific topics and concepts.
- Q: How should I store this book to keep it in good condition? A: Store the book upright on a shelf. This prevents warping and keeps the pages in good shape.
- Q: What is the best way to clean this hardcover book? A: To clean this book, gently wipe the cover with a soft cloth. Avoid using water or cleaners that could damage it.
- Q: What if I receive a damaged copy of the book? A: If you receive a damaged copy, contact the seller for a return or exchange. Most sellers have a return policy for such issues.
- Q: Does this book come with a warranty? A: No, this book does not come with a warranty. However, check with the retailer for their specific policies.
- Q: Can this book be used for academic courses? A: Yes, this book can be used for academic courses. It provides comprehensive material suitable for coursework.
- Q: What is the focus of the book's content? A: The book focuses on the creation and analysis of efficient data structures. It emphasizes understanding performance characteristics.
- Q: Is this book appropriate for self-study? A: Yes, this book is great for self-study. It provides clear explanations and examples for independent learners.