Convert Sorted Array to Binary Search Tree-白红宇

Convert Sorted Array to Binary Search Tree

阅读量：5330 次

发布时间：2019-06-14

本文共 1002 字，大约阅读时间需要 3 分钟。

Convert Sorted Array to Binary Search Tree

Total Accepted: 61516 Total Submissions: 173462 Difficulty: Medium

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    TreeNode* sortedArrayToBST(vector
        
         & nums,int start,int end){        if(end <= start) return NULL;        int mid = start + (end-start)/2;        TreeNode* root = new TreeNode(nums[mid]);        root->left = sortedArrayToBST(nums,start,mid);        root->right = sortedArrayToBST(nums,mid+1,end);        return root;    }    TreeNode* sortedArrayToBST(vector
         
          & nums) {        int nums_size = nums.size();        return sortedArrayToBST(nums,0,nums_size);    }};

Next challenges:

转载于:https://www.cnblogs.com/zengzy/p/5056210.html

你可能感兴趣的文章

【FZSZ2017暑假提高组Day9】猜数游戏(number)

mysql5.x升级至mysql5.7后导入之前数据库date出错的解决方法！

查看>>

对闭包的理解