def test_palindrome():
a = ['aabbaa', 'catac', 'ababab']
for x in a:
print(x)
li = LinkedList()
li.build_from_collection(x)
li.print_list()
print('Is a palindrome:', is_a_palindrome(li))
def test_partition():
a = [3, 5, 8, 5, 10, 2, 1]
li = LinkedList()
li.build_from_collection(a)
li.print_list()
partition(li, 5)
li.print_list()
def test_weave():
a = ['a1', 'a2', 'a3', 'a4', 'b1', 'b2', 'b3', 'b4']
print(a)
li = LinkedList()
li.build_from_collection(a)
li.print_list()
weave(li)
li.print_list()
def test_delete_middle_node():
a = ['a', 'b', 'c', 'd', 'e', 'f']
li = LinkedList()
li.build_from_collection(a)
li.print_list()
middle_node = kth_to_last(li, 3)
delete_middle_node(middle_node)
li.print_list()
def test_sum_lists(num_a, num_b):
a = LinkedList()
a_str = str(num_a)
for digit in a_str:
a.insert(int(digit))
b = LinkedList()
b_str = str(num_b)
for digit in b_str:
b.insert(int(digit))
a.print_list()
b.print_list()
result = sum_lists(a, b)
result.print_list()
