[LeetCode] Convert Sorted Array to Binary Search Tree

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

Hide Tags

Tree Depth-first Search

方法一：递归，也是dfs

/*** Definition for binary tree* struct TreeNode {*     int val;*     TreeNode *left;*     TreeNode *right;*     TreeNode(int x) : val(x), left(NULL), right(NULL) {}* };*/
class Solution {public:TreeNode *sortedArrayToBST(vector<int> &num){   int size = num.size();if(size == 0)return NULL;return sortedArrayToBSTInternal(num, 0, size - 1); }   TreeNode *sortedArrayToBSTInternal(vector<int> &num, int low, int high){   // the code is very important, i.e: low = 4, hight = 5, mid = 4, // will call sortedArrayToBSTInternal(num, 4, 3)if(low > high)return NULL;if(low == high)return new TreeNode(num[low]); int mid = (high-low)/2 + low;TreeNode *root = new TreeNode(num[mid]); TreeNode *left = sortedArrayToBSTInternal(num, low, mid - 1); TreeNode *right = sortedArrayToBSTInternal(num, mid + 1, high);root->left = left;root->right= right;return root;}
};

转载于:https://www.cnblogs.com/diegodu/p/4409809.html

[LeetCode] Convert Sorted Array to Binary Search Tree相关推荐

LeetCode: Convert Sorted Array to Binary Search Tree 解题报告
Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending ord ...
[LeetCode]Convert Sorted Array to Binary Search Tree
题目描述:(链接) Given an array where elements are sorted in ascending order, convert it to a height balanc ...
LeetCode - Convert Sorted Array to Binary Search Tree
给出一个已排序的数组,将其转化为二叉查找树(BST). 思路:取数组中间元素为根结点的value,则数组左侧.右侧分别为BST的左子树.右子树.递归可求解.代码如下: 1 /** 2 * Defini ...
arrayfunction[LeetCode]Convert Sorted Array to Binary Search Tree
新手发帖,很多方面都是刚入门,有错误的地方请大家见谅,欢迎批评指正每日一道理灯,带有一种明亮的光,每当深夜来临,是它陪伴着你,如此默默无闻.它是平凡的,外表华丽与否,那都是一样的,珍珠点缀,水晶加 ...
Convert Sorted Array to Binary Search Tree - LeetCode
目录题目链接注意点解法小结题目链接 Convert Sorted Array to Binary Search Tree - LeetCode 注意点不要访问空结点题目要求的是平衡二叉搜 ...
【数组递归构造二叉树】LeetCode 108. Convert Sorted Array to Binary Search Tree
LeetCode 108. Convert Sorted Array to Binary Search Tree Solution1:我的答案构造二叉树利用递归 /*** Definition fo ...
LeetCode: 108. Convert Sorted Array to Binary Search Tree
题目 Given an array where elements are sorted in ascending order, convert it to a height balanced BST. ...
Convert Sorted Array to Binary Search Tree With Minimal Height
Given a sorted (increasing order) array, Convert it to create a binary tree with minimal height. Exa ...
leetcode python3 简单题108. Convert Sorted Array to Binary Search Tree
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百零八题 (1)题目英文: Given an array where elem ...

[LeetCode] Convert Sorted Array to Binary Search Tree

[LeetCode] Convert Sorted Array to Binary Search Tree相关推荐

最新文章

热门文章