def test_insert_before_by_reordering(self):
l = SingleLinkedList([1])
node = l.get_n_th_node(0)
l.insert_before_by_reordering(node, 3)
self._check_list(l, (3, 1))
l.insert_before_by_reordering(node, 5)
self._check_list(l, (5, 3, 1))
node = l.get_n_th_node(2)
node = l.insert_before_by_reordering(node, 8)
self._check_list(l, (5, 3, 8, 1))
node = l.insert_before_by_reordering(node, 6)
self._check_list(l, (5, 3, 8, 6, 1))
