Cyndi #15

cyndilopez · 2019-09-04T03:49:54Z

No description provided.

CheezItMan

You hit the learning goals here and even got Breadth-First-Search. I like how you used stacks & queues to do the iterative solutions (nonrecursive).

Nice work!

CheezItMan · 2019-09-04T05:06:33Z

lib/example.rb

@@ -0,0 +1,64 @@
+class TreeNode


What's this file for?

CheezItMan · 2019-09-04T05:07:19Z

lib/tree.rb

  end

-  # Time Complexity: 
-  # Space Complexity: 
+  # Time Complexity: if well balanced, O(h) where h is the height of the tree


You could also say O(log n) if it's balanced, except that since you're going to visit each node in the tree, it has to be O(n)

CheezItMan · 2019-09-04T05:08:25Z

lib/tree.rb

  end

-  # Time Complexity: 
-  # Space Complexity: 
+  # Time Complexity: if balanced, O(h) where h is the height of the tree


Since you have to visit each node to figure out the height, it's O(n) for time complexity. Space is different.

CheezItMan · 2019-09-04T05:08:42Z

lib/tree.rb

+    stack = []
+    output = []
+    current = root
+    while current || !stack.empty?


It's neat how you used stacks here to avoid the recursive solution.

CheezItMan · 2019-09-04T05:09:18Z

lib/tree.rb

+    return [] if @root.nil?
+    queue = []
+    output = []
+    queue.push(@root)


branches

1830f34

CheezItMan reviewed Sep 4, 2019

View reviewed changes

Provide feedback