If you’ve ever struggled with solving problems using recursion, or if you have to brush up your skills for an interview, this course is for you.

We'll start with the basics of what recursion is and why it’s important before diving into practicing solving actual questions. You’ll have access to detailed explanations and visualizations for each problem to help you along the way. 

By the time you have completed this course, you’ll be able to use all the concepts to solve complex real-world problems. We hope that through practicing recursion, you will be able to ace all recursion related questions in interviews at top tech companies.

Recursion for Coding Interviews in JavaScript

## What is a Graph?
Graphs represent pairwise relationships between objects. A graph is typically represented as a set of _edges_ and a set of _nodes_.

A **node**, also known as a vertex, is a fundamental part of a graph. It is the entity that has a name, known as the `key`, and other information related to that entity. 
> A relationship between nodes is expressed using edges. 

An **edge** between two nodes expresses a one-way or two-way relationship between the nodes.

In a computer program, graphs are represented using an [Adjacency List](https://en.wikipedia.org/wiki/Adjacency_list) or an [Adjacency Matrix](https://en.wikipedia.org/wiki/Adjacency_matrix). We will be using adjacency list representation for this course. If you want to study graphs in detail, review [Interview Refresher Course on Data Structures in Javascript](https://www.educative.io/courses/data-structures-coding-interviews-javascript/what-is-a-graph).

The diagram below shows an example graph. It has $6$ nodes and $6$ edges.

# What is a Graph?
Graphs represent pairwise relationships between objects. A graph is typically represented as a set of _edges_ and a set of _nodes_.

A **node**, also known as a vertex, is a fundamental part of a graph. It is the entity that has a name, known as the `key`, and other information related to that entity. 
> A relationship between nodes is expressed using edges. 

An **edge** between two nodes expresses a one-way or two-way relationship between the nodes.

In a computer program, graphs are represented using an [Adjacency List](https://en.wikipedia.org/wiki/Adjacency_list) or an [Adjacency Matrix](https://en.wikipedia.org/wiki/Adjacency_matrix). We will be using adjacency list representation for this course. If you want to study graphs in detail, review [Interview Refresher Course on Data Structures in Javascript](https://www.educative.io/courses/data-structures-coding-interviews-javascript/what-is-a-graph).

The diagram below shows an example graph. It has $6$ nodes and $6$ edges.

In this lesson, we will learn about depth first traversal of a graph using recursion.

Recursion Fundamentals

Iteration Vs Recursion

Recursion with Numbers

Recursion with Strings

Recursion with Arrays

Recursion with Data Structures

Conclusion

Depth First Traversal of Graph

What is a Graph?