Update 200_number_of_islands.md

Author: Joseph Luce

leetcode/medium/200_number_of_islands.md

@@ -1,6 +1,6 @@
 # 200. Number of Islands
 
-## Traditional DFS Recursive Solution
+## BFS Recursive Solution
 - Runtime: O(N)
 - Space: O(N)
 - N = Number of elements in grid
@@ -16,10 +16,10 @@ class Solution:
                 for x_index, x in enumerate(y):
                     if (x_index, y_index) not in visited and x == '1':
                         n_islands += 1
-                        traverse_islands_dfs_recursion(x_index, y_index, grid, visited)
+                        traverse_islands_bfs_recursion(x_index, y_index, grid, visited)
             return n_islands
                     
-        def traverse_islands_dfs_recursion(x, y, grid, visited):
+        def traverse_islands_bfs_recursion(x, y, grid, visited):
             if not within_bounds(x, y, grid) or (x,y) in visited or grid[y][x] == '0':
                 return
             visited.add((x,y))