Item specifics
| Condition: | Good : A book that has been read but is in good condition. Very minimal damage to the cover including scuff marks, but no holes or tears. The dust jacket for hard covers may not be included. Binding has minimal wear. The majority of pages are undamaged with minimal creasing or tearing, minimal pencil underlining of text, no highlighting of text, no writing in margins. No missing pages. See the seller’s listing for full details and description of any imperfections. See all condition definitions– opens in a new window or tab |
|---|---|
| Seller Notes: | “Used book in good condition. Shows typical wear. Quick shipping. Satisfaction guaranteed!” |
| Language: | English | ISBN: | 9781070723884 |
| EAN: | 9781070723884 |
Easy Learning Data Structures & Algorithms ES6+Javascript: Classic data struc…
About this product
| Product Information | |
| Understand data structures and the associated algorithms, as well as the context in which they are used.Master existing JavaScript data structures such as array, set and map and learn how to implement new ones such as stacks, linked lists, trees and graphs.All concepts are explained in an easy way, followed by examples.You will gain an in-depth knowledge of how hash tables and set data structure functions, as well as how trees and hash maps This book is an accessible route deeper into JavaScript. Graphs being one of the most complex data structures you’ll encounter.ECMAScript 6 (ES6). This book provides a highly practical look at ES6, This book takes a user-friendly approach to covering ES6 Javascript data structures. 1. Bubble Sorting Algorithm2. Select Sorting Algorithm3. Insert Sorting Algorithm4. Dichotomy Binary Search5. Unidirectional Linked List5.1 Create and Initialization5.2 Add Node5.3 Insert Node5.4 Delete Node6. Doubly Linked List6.1 Create and Initialization6.2 Add Node6.3 Insert Node6.4 Delete Node7. One-way Circular LinkedList7.1 Initialization and Traversal7.2 Insert Node7.3 Delete Node8. Two-way Circular LinkedList8.1 Initialization and Traversal8.2 Insert Node8.3 Delete Node9. Queue10. Stack11. Recursive Algorithm12. Two-way Merge Algorithm13. Quick Sort Algorithm14. Binary Search Tree14.1 Construct a binary search tree14.2 Binary search tree In-order traversal14.3 Binary search tree Pre-order traversal14.4 Binary search tree Post-order traversal14.5 Binary search tree Maximum and minimum14.6 Binary search tree Delete Node15. Binary Heap Sorting16. Hash Table17. Graph17.1 Undirected Graph and Depth-Frst Search17.2 Undirected Graph and Breadth-First Search17.3 Directed Graph and Depth-Frst Search17.4 Directed Graph and Breadth-First Search17.5 Directed Graph Topological Sorting | |
| Product Identifiers | |
| Publisher | Independently Published |
| ISBN-10 | 1070723886 |
| ISBN-13 | 9781070723884 |
| eBay Product ID (ePID) | 21038697243 |
| Product Key Features | |
| Format | Trade Paperback |
| Publication Year | 2019 |
| Language | English |
| Dimensions | |
| Weight | 21.7 Oz |
| Width | 8in. |
| Height | 0.6in. |
| Length | 10in. |
| Additional Product Features | |
| Author | Yang Hu |
| Number of Pages | 220 Pages |
| Age Level | Trade |
Price : 64.95
Ends on : Ended
