MergeSortedLists created by iapain - https://repl.it/@iapain/MergeSortedLists

bst_merge.py

# 

main.py

pre_scores = [10, 20, 30, 40, 50, 60, 128, 150]
post_scores = [1, 30, 80, 100, 110, 115, 125, 126, 127, 128, 128]

# Merge sorted array in linear time
# O(n)
def merge_sorted_arrays(a, b):
  i = 0
  j = 0
  while (i < len(a) and j < len(b)):
    if (a[i] < b[j]):
      yield a[i]
      i += 1
    elif (a[i] == b[j]):
      yield a[i]
      yield b[j]
      i += 1
      j += 1
    else:
      yield b[j]
      j += 1
  if (i < len(a)):
    for x in range(i, len(a)): yield a[x]
  if (j < len(b)):
    for x in range (j, len(b)): yield b[x]

# Usage
print(list(merge_sorted_arrays(pre_scores, post_scores)))