-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
36 lines (35 loc) · 1.04 KB
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
using System;
namespace ConvertSortedArrayToBinarySearchTree
{
public class TreeNode
{
public int val;
public TreeNode left;
public TreeNode right;
public TreeNode(int val = 0, TreeNode left = null, TreeNode right = null)
{
this.val = val;
this.left = left;
this.right = right;
}
}
class Program
{
static void Main(string[] args)
{
int[] nums = {-10, -3, 0, 5, 9};
Console.WriteLine(SortedArrayToBST(nums));
}
static TreeNode SortedArrayToBST(int[] nums)
{
if (nums.Length == 0) return null;
int index = nums.Length / 2;
int[] left = index == nums.Length ? new int[0] : nums[..index];
int[] right = index == nums.Length? new int[0] : nums[(index + 1)..];
var root = new TreeNode(nums[index]);
root.left = SortedArrayToBST(left);
root.right = SortedArrayToBST(right);
return root;
}
}
}