diff --git a/Trees/BreadthFirstTreeTraversal.js b/Trees/BreadthFirstTreeTraversal.js
index 10fdc0aeb6..a61b3ca177 100644
--- a/Trees/BreadthFirstTreeTraversal.js
+++ b/Trees/BreadthFirstTreeTraversal.js
@@ -14,34 +14,33 @@ class Node {
 class BinaryTree {
   constructor () {
     this.root = null
-    this.traversal = []
   }
 
   breadthFirstIterative () {
-    this.traversal = []
+    const traversal = []
     if (this.root) {
-      this.traversal.push(this.root)
+      traversal.push(this.root)
     }
-    for (let i = 0; i < this.traversal.length; i++) {
-      const currentNode = this.traversal[i]
+    for (let i = 0; i < traversal.length; i++) {
+      const currentNode = traversal[i]
       if (currentNode.left) {
-        this.traversal.push(currentNode.left)
+        traversal.push(currentNode.left)
       }
       if (currentNode.right) {
-        this.traversal.push(currentNode.right)
+        traversal.push(currentNode.right)
       }
-      this.traversal[i] = currentNode.data
+      traversal[i] = currentNode.data
     }
-    return this.traversal
+    return traversal
   }
 
   breadthFirstRecursive () {
-    this.traversal = []
+    const traversal = []
     const h = this.getHeight(this.root)
     for (let i = 0; i !== h; i++) {
-      this.traverseLevel(this.root, i)
+      this.traverseLevel(this.root, i, traversal)
     }
-    return this.traversal
+    return traversal
   }
 
   // Computing the height of the tree
@@ -54,15 +53,15 @@ class BinaryTree {
     return lheight > rheight ? lheight + 1 : rheight + 1
   }
 
-  traverseLevel (node, levelRemaining) {
+  traverseLevel (node, levelRemaining, traversal) {
     if (node === null) {
       return
     }
     if (levelRemaining === 0) {
-      this.traversal.push(node.data)
+      traversal.push(node.data)
     } else {
-      this.traverseLevel(node.left, levelRemaining - 1)
-      this.traverseLevel(node.right, levelRemaining - 1)
+      this.traverseLevel(node.left, levelRemaining - 1, traversal)
+      this.traverseLevel(node.right, levelRemaining - 1, traversal)
     }
   }
 }
diff --git a/Trees/test/BreadthFirstTreeTraversal.test.js b/Trees/test/BreadthFirstTreeTraversal.test.js
index a6b795f31e..aa1a2795d4 100644
--- a/Trees/test/BreadthFirstTreeTraversal.test.js
+++ b/Trees/test/BreadthFirstTreeTraversal.test.js
@@ -8,7 +8,7 @@ describe('Breadth First Tree Traversal', () => {
   root.right = new Node(8)
   root.left.left = new Node(3)
   root.left.right = new Node(6)
-  root.right.right = new Node(9)
+  root.left.right.right = new Node(9)
   binaryTree.root = root
 
   // Visualization :
@@ -16,11 +16,17 @@ describe('Breadth First Tree Traversal', () => {
   //            7
   //           / \
   //          5   8
-  //         / \   \
-  //        3   6   9
+  //         / \
+  //        3   6
+  //             \
+  //              9
+
+  it('Binary tree - Empty case', () => {
+    const emptyTree = new BinaryTree()
+    expect(emptyTree.breadthFirstIterative()).toStrictEqual([])
+  })
 
   it('Binary tree - Level order recursive traversal', () => {
-    expect(binaryTree.traversal).toStrictEqual([])
     const traversal = binaryTree.breadthFirstRecursive()
     expect(traversal).toStrictEqual([7, 5, 8, 3, 6, 9])
   })