Complete Binary Search Tree

def solve(nums):
    nums = sorted(map(int, nums.split(',')))
    n = len(nums)
    result = [0] * n
    def build(start, end, idx):
        if start > end:
            return
        mid = (start + end) // 2
        result[idx] = nums[mid]
        build(start, mid - 1, 2 * idx + 1)
        build(mid + 1, end, 2 * idx + 2)
    build(0, n - 1, 0)
    print(' '.join(map(str, result)))