摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST./*** Definition for binary tree* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode(int x) { val = x; }* }*/public class Solution {public TreeNode sortedArrayToBST(int[] num) {/ 阅读全文