标签：sorted nim ble str lintcode 而不是 tag 遍历 HERE
给一个排序数组（从小到大），将其转换为一棵高度最小的排序二叉树。
There may exist multiple valid solutions, return any of them.
给出数组 [1,2,3,4,5,6,7], 返回
4 / 2 6 / \ / 1 3 5 7
标签：sorted nim ble str lintcode 而不是 tag 遍历 HERE
原文地址：https://www.cnblogs.com/Tang-tangt/p/9180166.html
