leaves - Natalie

lib/linked_list.rb

@@ -7,39 +7,75 @@ def initialize
     @head = nil
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(1)
+  # Space complexity - O(1)
   def add_first(data)
-
+    @head = Node.new(data, head)
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(1)
+  # Space complexity - O(1)
   def get_first
-
+    return nil if @head.nil?
+    return @head.data
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - ? O(n) where N is the number of elements in the linked list
+  # Space complexity - O(1)
   def length
-    return 0
+    counter = 0
+    current = @head
+    if current.nil? 
+      return 0
+    end
+
+    while current != nil
+      current = current.next
+      counter += 1
+    end
+
+    return counter
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(n) where n is the number of elements in the list
+  # Space complexity - O(1)
   def add_last(data)
+    new_node = Node.new(data, nil)
+    if @head.nil?
+      @head = new_node
+    else
+      current = head
 
+      until current.next.nil?
+        current = current.next
+      end
+      current.next = new_node
+    end
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(n) where N is number of elements in the list
+  # Space complexity - O(1)
   def get_last
+    current = head
+
+    while current.next != nil
+      current = current.next
+    end
 
+    return current.data
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(n) where N is the index
+  # Space complexity - ? O(1)
   def get_at_index(index)
+    if head.nil?
+      return nil
+    end
+    current = head
 
+    index.times do 
+      current = current.next
+    end
+    return current.data
   end
 end

test/linked_list_test.rb

@@ -21,7 +21,7 @@
     end
   end
 
-  xdescribe 'add_first & get_first' do
+  describe 'add_first & get_first' do
     it 'can add values to an empty list' do
       # Act
         @list.add_first(3)
@@ -51,7 +51,7 @@
     end
   end
 
-  xdescribe "length" do
+  describe "length" do
     it "will return 0 for an empty list" do
       expect(@list.length).must_equal 0
     end
@@ -66,7 +66,7 @@
     end
   end
 
-  xdescribe "addLast & getLast" do
+  describe "addLast & getLast" do
     it "will add to the front if the list is empty" do
       @list.add_last(1)
       expect(@list.get_first).must_equal 1
@@ -91,7 +91,7 @@
 
   end
 
-  xdescribe 'get_at_index' do
+  describe 'get_at_index' do
     it 'returns nil if the index is outside the bounds of the list' do
       expect(@list.get_at_index(3)).must_be_nil
     end