Convert sorted array/list to a height balanced BST.

Source: Internet
Author: User

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 ){  //  Start typing your Java Solution Below //  Do not write main () function  If (Num = Null  )  Return   Null  ;  Int Start = 0 ;  Int End = num. Length-1 ;  Return  Sortedarraytobst (Num, start, end );}  Public Treenode sortedarraytobst (Int [] Num, Int Start, Int  End ){  If (Num = Null  )  Return   Null  ;  While (Start <= End ){  Int Mid = start + (end-Start)/2 ; Treenode n = New Treenode (Num [Mid]); N. Left = Sortedarraytobst (Num, start, mid-1 ); N. Right = Sortedarraytobst (Num, Mid + 1 , End );  Return  N ;}  Return   Null  ;}}


Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.