Data Structures — Python Language Description
Tags
Summary
Editor's review
From an editor's professional perspective, the book's organization reflects a clear logical hierarchy. It begins with the basic concepts of data structures and gradually moves into core topics such as linear lists, stacks, queues, trees, and graphs, and also covers searching and sorting algorithms. Its greatest distinguishing feature is that it does not simply translate code from other language editions into Python; instead, it makes full use of Python's concise syntax and powerful built-in data structures (such as lists and dictionaries) to implement classic algorithms. This lowers the barrier to understanding for beginners while emphasizing the algorithmic ideas themselves. The abundant examples and diagrams in the book help readers build intuitive understanding.
However, the book is positioned more as a university textbook or a self-study introduction. For senior developers who have already mastered data structures and are seeking to use Python for high-performance algorithm optimization or to gain a deep understanding of Python's internal mechanisms, the depth may be somewhat insufficient. Overall, this is an excellent bridge book: it helps readers with a Python foundation systematically and smoothly build up their knowledge of data structures, and lays a solid foundation for subsequently studying more complex algorithms or entering the field of data science.
Who it's for
A good fit for
- University students in computer science or related majors, especially those currently taking a data structures course
- Self-learners who already know basic Python syntax and want to systematically study algorithms and data structures
- Career changers in fields such as data analysis and machine learning who need to strengthen their computer science fundamentals
- Readers looking for an introductory book that explains a classic subject using a modern, widely used language
Not a good fit for
- Senior engineers seeking in-depth discussion of Python's low-level implementation or advanced data structure optimization techniques
- Readers who prefer to learn data structures primarily in languages such as C/C++ or Java and who are preparing intensively for graduate entrance exams
Reading tips
- It is recommended to practice alongside a Python programming environment, typing in and debugging the code examples to understand each operation
- When reading, focus on understanding the algorithmic logic and ideas rather than getting overly caught up in language-specific syntax details
- The exercises at the end of each chapter are worth completing carefully; they are an effective way to test learning outcomes and consolidate key concepts
About the publisher
Posts & Telecom Press is known for its strengths in science and technology, computing, and information and communications titles, and has extended its publishing into photography, art, software learning, and inspirational growth, giving it a fairly diverse range. Its catalog includes computing and communications works such as Refactoring and Patterns (Revised Edition) and Huawei Switch Learning Guide (Second Edition), alongside bilingual collector's editions such as The Little Prince (Chinese-English-French illustrated collector's edition), The Great Gatsby, and Three Days to See. Beijing Ten Years: 1980-1990 and Ghost Blade: WLOP Personal Illustration Collection reflect its presence in photography and art. Its authors include Antoine de Saint-Exupéry, Helen Keller, Joshua Kerievsky, Wang Da, Zhang Zhaozeng, and WLOP.
Contents
- 版权信息
- 内容提要
- 前言
- 第1章 绪论
- 1.1 数据结构概述
- 1.2 数据类型概述
- 1.3 算法概述
- 1.4 本章小结
- 1.5 上机实验
- 习题
- 第2章 线性表
- 2.1 线性表简介
- 2.2 顺序表
- 2.3 链表
- 2.4 本章小结
- 2.5 上机实验
- 习题
- 第3章 栈、队列和递归
- 3.1 栈
- 3.2 队列
- 3.3 递归
- 3.4 本章小结
- 3.5 上机实验
- 习题
- 第4章 串、数组和广义表
- 4.1 串
- 4.2 数组和特殊矩阵
- 4.3 广义表
- 4.4 本章小结
- 4.5 上机实验
- 习题
- 第5章 树、二叉树和森林
- 5.1 树
- 5.2 二叉树
- 5.3 森林
- 5.4 哈夫曼树
- 5.5 本章小结
- 5.6 上机实验
- 习题
- 第6章 图
- 6.1 图的基本概念
- 6.2 图的存储结构
- 6.3 图的遍历
- 6.4 图的最小生成树
- 6.5 最短路径
- 6.6 拓扑排序
- 6.7 关键路径
- 6.8 本章小结
- 6.9 上机实验
- 习题
- 第7章 查找
- 7.1 查找的基本概念
- 7.2 基于静态查找表的查找
- 7.3 基于动态查找表的查找
- 7.4 本章小结
- 7.5 上机实验
- 习题
- 第8章 内排序
- 8.1 排序的基本概念
- 8.2 插入排序
- 8.3 交换排序
- 8.4 选择排序
- 8.5 归并排序
- 8.6 基数排序
- 8.7 本章小结
- 8.8 上机实验
- 习题
- 第9章 外排序
- 9.1 外排序概述
- 9.2 磁盘排序
- 9.3 本章小结
- 9.4 上机实验
- 习题
FAQ
How much Python background does this book require?
How does this book compare with classics such as Introduction to Algorithms?
Is the code in the book based on Python 2 or Python 3?
Comments
Find this book
This site is an index: you start “Search all sources” in your browser, and the entries it lists all point to third-party sites; please judge their availability yourself.
About the author
Zhang Guanghe is an author about whom little public information is available; his detailed biography, nationality, and educational background cannot currently be confirmed. Judging from the two works held in the database, his writing focuses on programming design and mobile development. His representative books include Data Structures: Described in Python and Android Mobile Development Case Tutorial: Based on the Android Studio Development Environment. The former explains the basic concepts and implementation methods of data structures using Python, serving introductory programming and computer science teaching; the latter centers on the Android Studio environment and introduces the Android mobile application development process through case studies. Both are practical technical textbooks that combine language tools with development practice, suitable as course materials or self-study references. Overall, Zhang Guanghe is a technical book author specializing in computer programming and mobile development topics, and his works offer reference value for readers in programming design.
