Python Data Structures and Algorithms Analysis (3rd Edition)

The original English edition of this book is Problem Solving with Algorithms and Data Structures Using Python, one of the classic textbooks that teach data structures and algorithms using Python. The book has eight chapters. Chapter 1 begins with computer science, problem solving, and object-oriented programming, preparing readers with the Python 3 syntax and class-design foundations they will need. Chapter 2 introduces algorithm analysis, focusing on Big O notation and examining the performance of various operations on Python lists and dictionaries. Chapter 3 uses the idea of abstract data types to explain stacks, queues, deques, and linked lists, with classic case studies such as parenthesis matching, number-base conversion, expression evaluation, queue simulation, and palindrome checking. Chapter 4 covers recursion, including the three laws of recursion, stack frames, recursion visualization, maze solving, and dynamic programming. Chapter 5 covers sequential search, binary search, and hashing, as well as bubble, selection, insertion, Shell, merge, and quick sorts, comparing their performance. Chapter 6 covers trees, including tree representations, parse trees, tree traversals, binary heaps and priority queues, binary search trees, and AVL balanced trees. Chapter 7 covers graphs, including two representations of graphs, breadth-first search and depth-first search, topological sorting, strongly connected components, and Dijkstra's and Prim's algorithms. Chapter 8 presents advanced topics, including RSA, skip lists, image quantization with octrees, DFAs, and KMP. The third edition rewrites the example code to follow PEP 8, updates outdated material, and adopts the new pythonds3 package; each chapter includes a summary, key terms, and exercises.