Learning JavaScript Data Structures and Algorithms, 2nd Edition

This is the Chinese translation of the second edition of Learning JavaScript Data Structures and Algorithms, brought in by People's Posts and Telecommunications Press in its Turing Programming Series · Web Development series. The book runs about 217 pages and roughly 160,000 characters, and it is built around "implementing things by hand in JavaScript" rather than stopping at pseudocode and theoretical description. It begins with JavaScript language fundamentals—variables, operators, truthy and falsy values, equality operators, control structures, functions, and object-oriented programming—and introduces new features from ES6 and ES7 as well as three ways to set up a code runtime environment: the browser, XAMPP, and Node.js. It then builds classic data structures in turn: arrays, stacks, queues, linked lists (including doubly and circular linked lists), sets, dictionaries and hash tables, trees (binary search trees and AVL self-balancing trees), and graphs. It explains basic operations such as declaration, initialization, and adding or removing elements, and also demonstrates how to use these structures to solve problems such as converting decimal to binary, playing the drum-passing game, handling hash collisions, and in-order/pre-order/post-order tree traversal. The algorithms section is the book's focus: sorting covers bubble, selection, insertion, merge, quick, and heap sort as well as distributed sorts such as counting, bucket, and radix sort; searching includes sequential and binary search; the graph chapter goes deeper into breadth-first and depth-first traversal, Dijkstra and Floyd-Warshall shortest paths, and Prim and Kruskal minimum spanning trees; the final part discusses algorithm patterns such as recursion, dynamic programming, greedy algorithms, and functional programming, compares complexity using Big O notation, and briefly introduces NP-complete problems.