Skip to content

Hunter Smith - Sprint-Challenge--Data-Structures-Python #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

Hunter Smith - Sprint-Challenge--Data-Structures-Python #1

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
652df0a
initial commit
Hunter315 Jan 25, 2019
2580204
depth_first_for_each
Hunter315 Jan 25, 2019
73a2aeb
breadth_first_ffor_each
Hunter315 Jan 25, 2019
c8c6ad6
names.py using sets complete in 0.031 seconds
Hunter315 Jan 25, 2019
eece83e
finished complexities answers (MVP MET)
Hunter315 Jan 25, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
breadth_first_ffor_each
  • Loading branch information
@Hunter315
Hunter315 committed Jan 25, 2019
commit 73a2aeb05741ee2774ee0584862af844e29324a3
8 changes: 4 additions & 4 deletions Data_Structures_Answers.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,13 +1,13 @@
Add your answers to the questions below.

1. What is the runtime complexity of your `depth_first_for_each` method?

O(n) , it runs through each node
2. What is the space complexity of your `depth_first_for_each` function?

O(n)
3. What is the runtime complexity of your `breadth_first_for_each` method?

O(n)
4. What is the space complexity of your `breadth_first_for_each` method?

O(n)

5. What is the runtime complexity of the provided code in `names.py`?

Expand Down
10 changes: 9 additions & 1 deletion search/binary_search_tree.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,15 @@ def depth_first_for_each(self, cb):


def breadth_first_for_each(self, cb):
pass
nodes = [self]
while len(nodes) > 0:
current = nodes.pop(0)
cb(current.value)
if current.left != None:
nodes.append(current.left)
if current.right != None:
nodes.append(current.right)


def insert(self, value):
new_tree = BinarySearchTree(value)
Expand Down