zoukankan      html  css  js  c++  java
  • 39.1: Convert Sorted Array to Binary Search Tree

    /************************************************************************/
                /*       39.1:  Convert Sorted Array to Binary Search Tree                               */
                /************************************************************************/
                /*
                 * Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
                 *
                 * */

     public TreeNode sortedArrayToBST(int[] num) 
                {
                    if(num==null|| num.length<1)
                    {
                        return null;
                    }
                    return buildhelper(0,num.length-1,num);
                }
                
                private TreeNode buildhelper(int start,int end,int[] num)
                {
                    
                    if(start>end)
                    {
                        return null;
                    }
                    int rootindex=start+(end-start)/2;
                    TreeNode root=new TreeNode(num[rootindex]);
                    root.left=buildhelper(start,rootindex-1,num);
                    root.right=buildhelper(rootindex+1,end,num);
                    return root;
                }
                
  • 相关阅读:
    Spring(一)Spring的基本应用
    flask摘记
    python摘记
    String Algorithm
    leetcode -- hard part
    leetcode -- medium part
    leetcodo--Easy part
    unix网络编程
    SQL
    计算机网络知识
  • 原文地址:https://www.cnblogs.com/theonemars/p/4254324.html
Copyright © 2011-2022 走看看