Easy Learning Data Structures & Algorithms ES6+Javascript: Classic data structures and algorithms in ES6+ JavaScript

Easy Learning Data Structures & Algorithms ES6+Javascript: Classic data structures and algorithms in ES6+ JavaScriptReviews
Author: yang hu
Pub Date: 2019
ISBN: 978-1070723884
Pages: 218
Language: English
Format: EPUB/AZW3
Size: 19 Mb


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 Algorithm
2. Select Sorting Algorithm
3. Insert Sorting Algorithm
4. Dichotomy Binary Search
5. Unidirectional Linked List
5.1 Create and Initialization
5.2 Add Node
5.3 Insert Node
5.4 Delete Node
6. Doubly Linked List
6.1 Create and Initialization
6.2 Add Node
6.3 Insert Node
6.4 Delete Node
7. One-way Circular LinkedList
7.1 Initialization and Traversal
7.2 Insert Node
7.3 Delete Node
8. Two-way Circular LinkedList
8.1 Initialization and Traversal
8.2 Insert Node
8.3 Delete Node
9. Queue
10. Stack
11. Recursive Algorithm
12. Two-way Merge Algorithm
13. Quick Sort Algorithm
14. Binary Search Tree
14.1 Construct a binary search tree
14.2 Binary search tree In-order traversal
14.3 Binary search tree Pre-order traversal
14.4 Binary search tree Post-order traversal
14.5 Binary search tree Maximum and minimum
14.6 Binary search tree Delete Node
15. Binary Heap Sorting
16. Hash Table
17. Graph
17.1 Undirected Graph and Depth-Frst Search
17.2 Undirected Graph and Breadth-First Search
17.3 Directed Graph and Depth-Frst Search
17.4 Directed Graph and Breadth-First Search
17.5 Directed Graph Topological Sorting