Question d’entretien chez ByteDance

Algorithm question: Given an array, build a binary tree with minimum height (recursive and non-recursive)