title: Linked Lists Homework in Python
body: <p>I have to do the following for my homework:</p>
  
  <ol>
  <li><p>Suppose that your linked list is not empty, and is pointed to by the variable head. Write a method called findMin() that goes through the list and finds the least value (you can compare strings just like numbers) and returns that.</p></li>
  <li><p>Suppose that your linked list is not empty, and is pointed to by the variable head. Write a method called getLast() that goes through the list and returns the last thing in the list. This is the value of the last node in the linked list chain.</p></li>
  <li><p>Finish the append method. It runs to the end and attaches the new node to the last existing nodes in the chain. If there are no nodes in the chain yet, it sets self.head to that node. Beware! This is tricky! You might consult your textbook.</p></li>
  </ol>
  
  <p>I attempted to solve the first one and I am just lost, I don't know if I am messing up the class structure or what (I just learned classes like 3 days ago)</p>
  
  <p>Here's my attempt...</p>
  
  <pre><code> class LinkedList:
  class Node:
      def __init__(self,value):
          self.value = value
          self.next  = none
  def __init__(self):
      self.head = None
  def findMin(self):
      currentNode = self.head
      minNode = self.head
      while currentNode != none:
          if currentNode.next &lt; currentNode:
              minNode = currentNode
              currentNode = currentNode.next
      return minNode
  </code></pre>