Partition a Linked List

gistfile1.txt

def dl_partition(x, ll):
  less_list = []
  higher_list = []
  for node in ll:
    if node.data >= x:
      higher_list.append(node.data)
     else:
      lower_list.append(node.data)
   less_list.reverse()
   higher_list.reverse()
   result = LinkedList()
   for val in less_list:
        result.push(val)
   for val in higher_list:
        result.push(val)
   return result