Given two values
k1 < k2) and a root pointer to a binary search tree, find all the keys in the tree in range
k2. Return all the keys in ascending order.
k1 = 10,
k2 = 22 and the following tree, return
[12, 20, 22].