diff --git a/challenges/breadthFirst/README.md b/challenges/breadthFirst/README.md
new file mode 100644
index 0000000..1efd168
--- /dev/null
+++ b/challenges/breadthFirst/README.md
@@ -0,0 +1,20 @@
+# Code Challenge 36
+<!-- Short summary or background information -->
+- Breadth First Traversal of a Graph
+
+## Challenge Description
+<!-- Description of the challenge -->
+- Extend your graph object with a breadth-first traversal method that accepts a starting node
+- Without utilizing any of the built-in methods available to your language, return a collection of nodes in the order they were visited
+- Display the collection
+
+## Approach & Efficiency
+<!-- What approach did you take? Why? What is the Big O space/time for this approach? -->
+- Approach
+- Big O
+  - Space O(n)
+  - Time O(n)
+
+## Solution
+<!-- Embedded whiteboard image -->
+![whiteboard](../../assets/breadth-first.jpg "breadth-first whiteboard")
diff --git a/challenges/breadthFirst/breadth-first.js b/challenges/breadthFirst/breadth-first.js
new file mode 100644
index 0000000..025fe73
--- /dev/null
+++ b/challenges/breadthFirst/breadth-first.js
@@ -0,0 +1,5 @@
+'use strict';
+
+// cc
+
+module.exports = breadthFirst;
diff --git a/challenges/breadthFirst/breadth-first.test.js b/challenges/breadthFirst/breadth-first.test.js
new file mode 100644
index 0000000..e69de29