标签：
Given a sorted (increasing order) array, Convert it to create a binary tree with minimal height.
Given [1,2,3,4,5,6,7], return
4
/ 2 6
/ \ / 1 3 5 7
There may exist multiple valid solutions, return any of them.
//////////////////////
二叉查找树（Binary Search Tree），也称有序二叉树（ordered binary tree）,排序二叉树（sorted binary tree），是指一棵空树或者具有下列性质的二叉树：
平衡二叉树（引自GeekforGeek）：
An empty tree is height-balanced. A non-empty binary tree T is balanced if:
1) Left subtree of T is balanced
2) Right subtree of T is balanced
3) The difference between heights of left subtree and right subtree is not more than 1.
////////////////////////////////////////////////////
/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * this.val = val; * this.left = this.right = null; * } * } */ public class Solution { /** * @param A: an integer array * @return: a tree node */ public TreeNode sortedArrayToBST(int[] A) { // write your code here if(A.length==0) return null; return buildTree(A,0,A.length-1); } public TreeNode buildTree(int[] A, int low, int high) { if(low>high) return null; int mid=(low+high)/2; TreeNode node=new TreeNode(A[mid]); node.left=buildTree(A,low,mid-1); node.right=buildTree(A,mid+1,high); return node; } }
[lintcode easy]Convert Sorted Array to Binary Search Tree With Minimal Height
标签：
原文地址：http://www.cnblogs.com/kittyamin/p/5008998.html
