input: Write a function to determine if a given linked list can be reordered such that the nodes are in non-decreasing order of their values by performing any number of right rotation operations. If it is possible, return True; otherwise, return False. If the linked list is empty, return True.
  assert linked_list_reorder(ListNode(1, ListNode(2, ListNode(3, ListNode(4)))))==True
  assert linked_list_reorder(ListNode(3, ListNode(1, ListNode(2, ListNode(4)))))==True
  assert linked_list_reorder(ListNode(4, ListNode(3, ListNode(1, ListNode(2)))))==False
  assert linked_list_reorder(ListNode(5, ListNode(3, ListNode(1, ListNode(4)))))==False
  assert linked_list_reorder(None)==True
output: def linked_list_reorder(head):
      if not head:
          return True
      values = []
      current = head
      while current:
          values.append(current.val)
          current = current.next
      n = len(values)
      for i in range(n - 1):
          if values[i] > values[i + 1]:
              return False
      return True