Faiza A.

lib/tree.rb

@@ -18,45 +18,101 @@ def initialize
 
   # Time Complexity: 
   # Space Complexity: 
-  def add(key, value)
-    raise NotImplementedError
+  def add(key, value, current = @root)
+    new_node = TreeNode.new(key, value)
+
+    if @root == nil
+      @root = new_node
+    else
+      if key <= current.key
+
+        if current.left == nil
+          current.left = new_node
+        else
+          add(key, value, current.left)
+        end
+
+      else
+
+        if current.right == nil
+          current.right = new_node
+        else
+          add(key, value, current.right)
+        end
+
+      end
+    end
   end
 
-  # Time Complexity: 
-  # Space Complexity: 
-  def find(key)
-    raise NotImplementedError
+  # Time Complexity:
+  # Space Complexity:
+  def find(key, current = @root)
+    if @root == nil
+      return nil
+    elsif key == current.key
+      return current.value
+    elsif key <= current.key
+      find(key, current.left)
+    else
+      find(key, current.right)
+    end
   end
 
   # Time Complexity: 
   # Space Complexity: 
-  def inorder
-    raise NotImplementedError
+  def inorder(current = @root, array = [])
+    if current == nil
+      return array
+    else
+      inorder(current.left, array)
+      array << { key: current.key, value: current.value }
+      inorder(current.right, array)
+    end
   end
 
+
+
   # Time Complexity: 
   # Space Complexity: 
-  def preorder
-    raise NotImplementedError
+  def preorder(current = @root, array = [])
+    if current  == nil
+      return array
+    else
+      array << { key: current.key, value: current.value }
+      preorder(current.left, array)
+      preorder(current.right, array)
+    end
   end
 
   # Time Complexity: 
   # Space Complexity: 
-  def postorder
-    raise NotImplementedError
+  def postorder(current = @root, array = [])
+    if current == nil
+      return array
+    else
+      postorder(current.left, array)
+      postorder(current.right, array)
+      array << { key: current.key, value: current.value }
+    end
   end
 
   # Time Complexity: 
   # Space Complexity: 
-  def height
-    raise NotImplementedError
+  def height(current = @root, array)
+
   end
 
   # Optional Method
   # Time Complexity: 
   # Space Complexity: 
-  def bfs
-    raise NotImplementedError
+  def bfs(current = @root, array = [])
+    if current == nil
+      return array
+    else
+      bfs(current.left, array)
+      array << { key: current.key, value: current.value }
+      bfs(current.right, array)
+    end
   end
 
   # Useful for printing

test/tree_test.rb

@@ -1,5 +1,7 @@
 require_relative 'test_helper'
-
+require 'minitest/autorun'
+require 'minitest/reporters'
+require 'minitest/skip_dsl'
 
 Minitest::Reporters.use! Minitest::Reporters::SpecReporter.new