GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-07 18:08:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Simplified check to determine if there are items in the queue.

Browse Source
This commit is contained in:
Donne Martin
2015-08-05 05:45:30 -04:00
parent 370ceaf414
commit 25eaf0224a
1 changed files with 1 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
graphs_trees/tree_bfs/bfs_solution.ipynb
View File

@@ -34,8 +34,6 @@
"## Constraints\n", "## Constraints\n",
"\n", "\n",
"* Can we assume we already have a Node class with an insert method?\n", "* Can we assume we already have a Node class with an insert method?\n",
" * Yes\n",
"* Can we use collections.deque for the queue?\n",
" * Yes" " * Yes"
] ]
}, },
@@ -98,7 +96,7 @@
"def bfs(root, visit_func):\n", "def bfs(root, visit_func):\n",
" queue = deque()\n", " queue = deque()\n",
" queue.append(root)\n", " queue.append(root)\n",
" while len(queue) > 0:\n", " while queue:\n",
" node = queue.popleft()\n", " node = queue.popleft()\n",
" visit_func(node.data)\n", " visit_func(node.data)\n",
" if node.left is not None:\n", " if node.left is not None:\n",