{"product_id":"139851","title":"Data structures that fit in one place ","description":"\u003ccenter\u003e\u003cdiv style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/tmgdisk01.cafe24.com\/images\/vs\/4172\/sv\/3jXOZ6kxCNTzSOqGj1vMnz0sNMTXAl.png?v=1765076799\" style=\"max-width:100%;max-height:10px\"\u003e\u003c\/div\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\n\n\u003cdiv style=\"width:95%\"\u003e\n\n\u003cdiv style=\"text-align:center;font-size:30px;font-weight:bolder;line-height:1.6em\"\u003e Data structures that fit in one place \u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"border-bottom:1px;border-bottom-style:dotted;border-color:;padding-bottom:20px\"\u003e\u003ccenter\u003e\u003ctable align=\"center\" width=\"100%\"\u003e\u003ctbody style=\"border:0px\"\u003e\n\n\u003ctr\u003e\u003ctd align=\"center\" style=\"line-height:1.2em;text-align:center;font-size:18px;color:black;font-weight:bold;padding-bottom:20px;\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\u003ctr\u003e\u003ctd style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/image.yes24.com\/goods\/153906403\/XL\" style=\"max-width:100%;height:auto\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\n\u003c\/tbody\u003e\u003c\/table\u003e\u003c\/center\u003e\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;{split_style6}padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e Description \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;word-break:break-all;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eBook Introduction\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e\u003cdiv\u003e \u003cb\u003eThe best way to start learning data structures easily: with minimal theory and maximum understanding.\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Without complex mathematical formulas or abstract theories, the essence of data structures is explained in an easy and fun way with fun real-life examples, illustrations, and code that only contains the core.\u003cbr\u003e It systematically guides developers through the data structures they must know, including arrays, Big-O notation, linked lists, stacks, queues, heaps, binary search trees, and graphs.\u003cbr\u003e You can also naturally develop a sense of when to choose which structure.\u003cbr\u003e If you want to build your foundation as a developer, prepare for coding tests, or better utilize data structures in your work, this book will be a great starting point. \u003cbr\u003eLet's start the world's friendliest data structures class right now.\u003cbr\u003e\n\n\u003c\/div\u003e\u003c\/div\u003e\n\u003cdiv\u003e\u003cul\u003e\u003cli\u003e You can preview some of the book's contents.\u003cbr\u003e \u003cspan\u003ePreview\u003c\/span\u003e\n\n\u003c\/li\u003e\u003c\/ul\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eindex\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e Translator's Preface ix\u003cbr\u003e Beta Reader Review x\u003cbr\u003e Recommendation xii\u003cbr\u003e Preface xiv\u003cbr\u003e Acknowledgments xvi\u003cbr\u003e About this book xviii\u003cbr\u003e\u003cbr\u003e CHAPTER 01 Introduction to Data Structures: Why Learn Data Structures? 1\u003cbr\u003e Welcome 1\u003cbr\u003e What is a data structure? 3\u003cbr\u003e Why should you care about data structures? 4\u003cbr\u003e How to use data structures in a project? 8\u003cbr\u003e Summary 14\u003cbr\u003e\u003cbr\u003e CHAPTER 02 Static Arrays: The Starting Point of Data Structures 15\u003cbr\u003e What is an array? 15\u003cbr\u003e Arrays in Python 21\u003cbr\u003e Working with Arrays 23\u003cbr\u003e Practical Uses of Arrays 28\u003cbr\u003e Summary 31\u003cbr\u003e\u003cbr\u003e CHAPTER 03 Sorted Arrays: Fast Searches and Efficient Data Management 33\u003cbr\u003e What does a sorted array mean? 33\u003cbr\u003e Sorted Array Implementation 34\u003cbr\u003e Summary 41\u003cbr\u003e\u003cbr\u003e CHAPTER 04 Big-O Notation: Fundamentals of Algorithmic Efficiency 43\u003cbr\u003e How can I make the best choice? 43\u003cbr\u003e Big-O Notation 46 \u003cbr\u003eExample 55 of Asymptotic Analysis\u003cbr\u003e Summary 59\u003cbr\u003e\u003cbr\u003e CHAPTER 05 Dynamic Arrays: Data Structures That Flexibly Resize 60\u003cbr\u003e Limitations of Static Arrays 61\u003cbr\u003e How can I increase the size of an array? 63\u003cbr\u003e Trophy Display Case 63\u003cbr\u003e Should I also reduce the size of the array? 68\u003cbr\u003e Implementing Dynamic Arrays 71\u003cbr\u003e Summary 76\u003cbr\u003e\u003cbr\u003e CHAPTER 06 Linked Lists: Flexible, Dynamic Collections 77\u003cbr\u003e Linked List vs.\u003cbr\u003e Array 78\u003cbr\u003e Singly linked list 80\u003cbr\u003e Sorted linked list 88\u003cbr\u003e Doubly linked list 90\u003cbr\u003e Circular Linked List 97\u003cbr\u003e Summary 100\u003cbr\u003e\u003cbr\u003e CHAPTER 07 Abstract Data Types: Design Principles for Simple Containers 102\u003cbr\u003e Abstract data types vs.\u003cbr\u003e Data Structures 103\u003cbr\u003e Container 108\u003cbr\u003e The most basic container: Bag 110\u003cbr\u003e Summary 115\u003cbr\u003e\u003cbr\u003e CHAPTER 08 Stack: A Stacking Structure for Data Processing 117\u003cbr\u003e Stack as an Abstract Data Type 118\u003cbr\u003e Stack as a Data Structure 121\u003cbr\u003e Linked List Implementation 124\u003cbr\u003e Theory and Reality 127\u003cbr\u003e Application of Additional Stacks 129\u003cbr\u003e Summary 133\u003cbr\u003e\u003cbr\u003e CHAPTER 09 Stack: A Stacking Structure for Data Processing 117\u003cbr\u003e Queue as an Abstract Data Type 134 \u003cbr\u003eQueues as Data Structures 138\u003cbr\u003e Implementation 144\u003cbr\u003e What about dynamic arrays? 150\u003cbr\u003e More Applications of Queues 152\u003cbr\u003e Summary 153\u003cbr\u003e\u003cbr\u003e CHAPTER 10: Stacking Structures for Data Processing 117\u003cbr\u003e Expanding the Queue with Priority 154\u003cbr\u003e Using Priority Queues as Data Structures 157\u003cbr\u003e Hip 160\u003cbr\u003e Heap Implementation 163\u003cbr\u003e Practical Uses of Priority Queues 173\u003cbr\u003e Summary 175\u003cbr\u003e\u003cbr\u003e CHAPTER 11: Stacks: A Stacking Structure for Data Processing 117\u003cbr\u003e What is a tree? 176\u003cbr\u003e Binary Search Tree 180\u003cbr\u003e Balanced Tree 192\u003cbr\u003e Summary 195\u003cbr\u003e\u003cbr\u003e CHAPTER 12 Dictionaries and Hash Tables: Building and Using Associative Arrays 196\u003cbr\u003e Dictionary Problem 197\u003cbr\u003e Data Structures Implementing Dictionaries 199\u003cbr\u003e Hash Table 201\u003cbr\u003e Hashing 204\u003cbr\u003e Conflict Resolution 206\u003cbr\u003e Summary 213\u003cbr\u003e\u003cbr\u003e CHAPTER 13 Graphs: Efficiently Modeling Complex Relationships 214\u003cbr\u003e What is a Graph? 214\u003cbr\u003e Graph Implementation 221\u003cbr\u003e Graph Exploration 225\u003cbr\u003e Step 232 remaining\u003cbr\u003e Summary 233\u003cbr\u003e\u003cbr\u003e Search 235\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eDetailed image\u003c\/b\u003e \u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\u003cdiv\u003e\u003cimg src=\"https:\/\/image.yes24.com\/momo\/TopCate5647\/MidCate010\/564691013.jpg\" border=\"0\" alt=\"Detailed Image 1\"\u003e\u003c\/div\u003e\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eInto the book\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e  \u003cdiv\u003eIf you're reading this book, you probably know that we live in what's commonly referred to as the \"data age.\"\u003cbr\u003e In this era, data has become an indispensable element of our lives, and thanks to technological advancements, the speed of information production is increasing exponentially more than ever before.\u003cbr\u003e This massive flow of data is changing how we live, work, and even communicate with each other.\u003cbr\u003e \/ To properly understand this vast amount of information and avoid being overwhelmed by it, we need a way to organize the information effectively.\u003cbr\u003e This is where data structures come into play.\u003cbr\u003e Data structures are the way computers and programs store and organize information, helping them manage and manipulate data more efficiently.\u003cbr\u003e\u003cbr\u003e --- p.3\u003cbr\u003e\u003cbr\u003e After much crying and arguing, Kim's parents finally agreed to provide a new display case to house her new trophies. \u003cbr\u003eBut he set a condition.\u003cbr\u003e The existing display case cannot be expanded and must be discarded, and the cost of purchasing a new display case and disposing of the old one must be paid for with money from Kim's piggy bank.\u003cbr\u003e If she doesn't have enough money to buy a new display case, she'll have no choice but to throw away some of her old robots.\u003cbr\u003e \/ So Kim has no choice but to find the optimal strategy to save as much money as possible in the long run (she might consider using modular furniture).\u003cbr\u003e That's true, but let's assume for this analogy that we don't provide a modular solution.\u003cbr\u003e\u003cbr\u003e --- p.64\u003cbr\u003e\u003cbr\u003e The team is developing their first video game.\u003cbr\u003e A quick look at the game reveals that it is a side-scroller where the protagonist moves from left to right within a building, moving from one room to another.\u003cbr\u003e The team carefully designed the rooms and implemented each one individually. \u003cbr\u003eNow all that remains is to model the progression between rooms.\u003cbr\u003e \/ 'What should we do with this?' the team pondered.\u003cbr\u003e \/ The framework the team uses basically provides a singly linked list, which can save a lot of development time.\u003cbr\u003e However, if a singly linked list is used, the game protagonist can only go to the right room and cannot go back.\u003cbr\u003e --- p.92\u003cbr\u003e\u003cbr\u003e Priyanka recently joined a startup that, from the outside, looks absolutely fantastic.\u003cbr\u003e Their mission resonated well with her, and the AI ​​technology the founders developed was also appealing.\u003cbr\u003e But she had no idea that, beyond its core technology, the company's infrastructure and organization were in shambles.\u003cbr\u003e She didn't even have a proper task management tool, and her bug backlog consisted of sticky notes taped to her desk, monitor, and small kitchen table. \u003cbr\u003e\/ So, 'scrolling' through the backlog meant collecting these sticky notes, searching around the office, deciphering the handwriting, or trying to figure out who wrote them.\u003cbr\u003e In these situations, it's easier to miss and forget about bugs than to fix them.\u003cbr\u003e After missing a week of bug fixes and receiving a red flag, Priyanka couldn't take it anymore.\u003cbr\u003e\u003cbr\u003e --- p.137\u003cbr\u003e\u003cbr\u003e Mario has a good memory, but now that he has collected hundreds of cards, he has trouble remembering which ones he already owns and which ones he doesn't.\u003cbr\u003e This is especially true when trading cards with friends, as you need to quickly choose a card before the other person takes it. \u003cbr\u003eTo stay ahead of the competition, Mario plans to utilize a mobile app that lets players scan a card with their camera and see in seconds whether that card is already in their collection and how many copies they have.\u003cbr\u003e \/ The core feature of this app (besides p.UX and object recognition) is the dictionary.\u003cbr\u003e A dictionary stores data with a specific key and retrieves data based on the key.\u003cbr\u003e For baseball cards, you can use the player's name or even a photo of the card as a key.\u003cbr\u003e In this example, the key could be associated with an attribute such as the number of copies of a card you own, or details about the card (team information, statistics, etc.).\u003cbr\u003e\u003cbr\u003e --- p.197\u003cbr\u003e\u003cbr\u003e According to information gathered by the campaign manager, the rabbit is a social network star, and gaining its support could change the course of the election.\u003cbr\u003e Tiger Headquarters wants to understand how far Rabbit has fallen from his friend chain. \u003cbr\u003eHe also wants to know what the shortest path is between the tiger and the rabbit.\u003cbr\u003e The plan is to start with one of Tiger's friends, who will introduce Tiger to another of their friends, who will then introduce Tiger to another of their friends, and so on.\u003cbr\u003e This process is repeated until the rabbit is reached, with the shorter the path, the fewer people involved.\u003cbr\u003e \/ The breadth-first search (BFS) algorithm does exactly this.\u003cbr\u003e\n\n\u003c\/div\u003e\n\u003cdiv\u003e --- p.226\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003cbr\u003e\u003cdiv\u003e\u003ch5\u003e \u003cb\u003ePublisher's Review\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e \u003cb\u003eThe easiest data structure lesson explained with pictures and stories\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e Data structures are an essential topic in learning programming.\u003cbr\u003e However, when you actually try to study, you often have the preconceived notion that it is difficult and boring.\u003cbr\u003e 《Data Structures in a Nutshell》 is an introductory book on data structures that breaks these prejudices and allows anyone to approach data structures in a fun way.\u003cbr\u003e\u003cbr\u003e \u003cbr\u003eInstead of complex mathematical formulas or abstract explanations, the concepts of data structures are explained through real-life examples and interesting illustrations.\u003cbr\u003e By systematically learning essential data structures one by one, including arrays, Big-O notation, linked lists, stacks, queues, heaps, hash tables, graphs, and binary search trees, you will not only memorize the concepts, but also be able to answer fundamental questions such as, \"Why use this structure?\" and \"In what situations is it suitable?\"\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e In particular, familiar analogies that can be encountered in real life, such as organizing a trophy display case, searching for baseball cards, managing box inventory, and triaging emergency room patients, help readers naturally recall the concepts, and intuitive illustrations and concise Python code are added to make it easy to understand and practice right away.\u003cbr\u003e\u003cbr\u003e \u003cbr\u003eThis book will serve as a solid first step for beginners in development, and a great opportunity for practitioners to re-establish their understanding of data structures.\u003cbr\u003e It will serve as a reliable guide not only for learners preparing for coding tests, but also for developers who want to effectively utilize data structures in the field.\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e Data structures are no longer scary.\u003cbr\u003e As you explore the illustrations, stories, and executable code, you'll find yourself strengthening your fundamental skills as a developer.\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e \u003cb\u003eKey Contents\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e ● Principles and implementation of core structures such as arrays, linked lists, queues, and stacks\u003cbr\u003e ● Big-O notation you must know when selecting a data structure\u003cbr\u003e ● Complex data processed with priority queues and heaps\u003cbr\u003e ● Understanding binary search trees and balanced trees that make searching easier\u003cbr\u003e ● Use of hash tables and graphs frequently used in practice\u003cbr\u003e ● All examples are implemented directly in Python and practiced\u003cbr\u003e\n\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e GOODS SPECIFICS\u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;font-size:14px;line-height:1.6em;\"\u003e\n\n \u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e- \u003cstrong\u003eDate of issue:\u003c\/strong\u003e September 26, 2025\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003ePage count, weight, size:\u003c\/strong\u003e 260 pages | 188*245*16mm\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN13:\u003c\/strong\u003e 9791194587590 \u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cspan\u003e\u003c\/span\u003e\n\n\u003c\/center\u003e\n\n\n\u003c\/center\u003e","brand":"LIBRAIRIE COREENNE","offers":[{"title":"Default Title","offer_id":43893381136426,"sku":"139851","price":37.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0683\/2750\/5962\/files\/2f3e641cfdaca2b45d3825d085135602.jpg?v=1765399356","url":"https:\/\/librairie.coreenne.fr\/en\/products\/139851","provider":"LIBRAIRIE COREENNE","version":"1.0","type":"link"}