Sign In Start Free Trial

Book Overview & Buying
Table Of Contents

Learning JavaScript Data Structures and Algorithms

By : Loiane Avancini

4.3 (24)

Learning JavaScript Data Structures and Algorithms

4.3 (24)

By: Loiane Avancini

Overview of this book

If you are a JavaScript developer or someone who has basic knowledge of JavaScript, and want to explore its optimum ability, this fast-paced book is definitely for you. Programming logic is the only thing you need to know to start having fun with algorithms.

Preface

Preface

What this book covers

What you need for this book

Who this book is for

Conventions

Reader feedback

Customer support

Free Chapter

1. JavaScript – A Quick Overview

1. JavaScript – A Quick Overview

Setting up the environment

JavaScript basics

Control structures

Functions

Object-oriented programming

Debugging and tools

Summary

2. Arrays

2. Arrays

Why should we use arrays?

Creating and initializing arrays

Adding and removing elements

Two-dimensional and multi-dimensional arrays

References for JavaScript array methods

Summary

3. Stacks

3. Stacks

Creating a stack

Decimal to binary

Summary

4. Queues

4. Queues

Creating a queue

The priority queue

The circular queue – Hot Potato

Summary

5. Linked Lists

5. Linked Lists

Creating a linked list

Doubly linked lists

Circular linked lists

Summary

6. Sets

6. Sets

Creating a set

Set operations

Summary

7. Dictionaries and Hashes

7. Dictionaries and Hashes

Dictionaries

The hash table

Summary

8. Trees

8. Trees

Trees terminology

Binary tree and binary search tree

Tree traversal

Searching for values in a tree

More about binary trees

Summary

9. Graphs

9. Graphs

Graph terminology

Representing a graph

Creating the Graph class

Graph traversals

Summary

10. Sorting and Searching Algorithms

10. Sorting and Searching Algorithms

Sorting algorithms

Searching algorithms

Summary

Index

Index

Creating a stack

We are going to create our own class to represent a stack. Let's start from the basics and declare our class:

function Stack() {
    //properties and methods go here
}

First, we need a data structure that will store the elements of the stack. We can use an array to do this:

var items = [];

Next, we need to declare the methods available for our stack:

push(element(s)): This adds a new item (or several items) to the top of the stack.
pop(): This removes the top item from the stack. It also returns the removed element.
peek(): This returns the top element from the stack. The stack is not modified (it does not remove the element; it only returns the element for information purposes).
isEmpty(): This returns true if the stack does not contain any elements and false if the size of the stack is bigger than 0.
clear(): This removes all the elements of the stack.
size(): This returns how many elements the stack contains. It is similar to the length property of an array.

The first method...

Visually different images

CONTINUE READING

83

Tech Concepts

36

Programming languages

73

Tech Tools

Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.

Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.

50+ new titles added per month and exclusive early access to books as they are being written.

Learning JavaScript Data Structures and Algorithms

Search

Your notes and bookmarks