I have to make a BST implementation without making use of classes Each node is a list of length four where positions 0 = key, 1 = value, 2 = left-child, 3 = right-child
