摘要：
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) {/ 阅读全文
posted @ 2013-05-21 17:52
Alan Yang
阅读(308)
评论(0)
推荐(0)
浙公网安备 33010602011771号