用LUA（和C++）刷PAT (Advanced Level) ——1064 Complete Binary Search Tree

local readF = io.read('*a'):gmatch('%d+')
local function readFunc()
    return tonumber(readF())
end

local numbers = {} tree = {} N = readFunc()

for i = 1, N do
    table.insert(numbers, readFunc())
end

table.sort(numbers, function(a, b) return a < b end)

local number_index = 1

generateTree = function(root_index)
    if root_index > N then
        return
    end
    generateTree(root_index * 2)
    tree[root_index] = numbers[number_index]
    number_index = number_index + 1
    generateTree(root_index * 2 + 1)
end

generateTree(1)

print(table.concat(tree," "))