Karma problem ------------- A. *Define a function* that consumes a list of stations and produces a 1D-tree containing those same stations. The 1D-tree must be balanced, which in this case means that its depth must be at most one more than the base-2 logarithm of the number of stations. This problem really needs an auxiliary data structure. We will come back to it.