将一个按照升序排列的有序数组,转换为一棵高度平衡二叉搜索树。
本题中,一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。
示例:
给定有序数组: [-10,-3,0,5,9],
一个可能的答案是:[0,-3,9,-10,null,5],它可以表示下面这个高度平衡二叉搜索树:
0
/ \
-3 9
/ /
-10 5
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int x) { val = x; }
* }
*/
public class Solution
{
public TreeNode SortedArrayToBST(int[] nums)
{
if (nums.Length == 0)
{
return null;
}
int left = 0;
int right = nums.Length - 1;
int mid = (left + right) / 2;
TreeNode Root = new TreeNode(nums[mid]);
Root.left = CreateBST(nums, 0, mid - 1);
Root.right = CreateBST(nums, mid + 1, right);
return Root;
}
public TreeNode CreateBST(int[] nums, int left, int right)
{
if (left > right)
{
return null;
}
int mid = (left + right) / 2;
TreeNode temp = new TreeNode(nums[mid]);
temp.left = CreateBST(nums, left, mid - 1);
temp.right = CreateBST(nums, mid + 1, right);
return temp;
}
}