Branches - Farah

lib/linked_list.rb

@@ -1,4 +1,5 @@
 require_relative 'node'
+require 'pry'
 
 class LinkedList
   attr_reader :head
@@ -7,39 +8,72 @@ def initialize
     @head = nil
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(1) where 1 is the one node created
+  # Space complexity - O(1) where 1 is the one node created in space
   def add_first(data)
-
+    @head = Node.new(data, head)
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(1) because it is grabbing the first node in the list
+  # Space complexity - O(1) because it is returning one node
   def get_first
-
+    return nil if head.nil?
+    return @head.data
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(n) where n is the length of the linked list
+  # Space complexity - O(1) because only a single number is being returning, the length of the list
   def length
-    return 0
+    count = 0
+    current = @head
+    until current.nil?
+      count += 1
+      current = current.next
+    end
+    return count
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(n) where n is the length of the entire list
+  # Space complexity - O(1) because you are adding one node
   def add_last(data)
+    current = @head
 
+    if current.nil?
+      add_first(data)
+      return
+    end
+
+    until current.next == nil
+      current = current.next
+    end
+    current.next = Node.new(data)
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(n) where n is the length of the entire list
+  # Space complexity - O(1) because you are returning informatio on one node
   def get_last
+    current = @head
+    until current.next == nil
+      current = current.next
+    end
 
+    return current.data
   end
 
-  # Time complexity - ?
-  # Space complexity - ?
+  # Time complexity - O(n) where n is the length of the list, in worst case scenario
+  # Space complexity - O(1) because only single node data is returned
   def get_at_index(index)
+    current = @head
+    if current.nil?
+      return nil
+    end
+
+    i = 0
+    while i != index
+      i += 1
+      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