feat: easy: convert-sorted-array-to-binary-search-tree.go

Author: illiafox

src/medium/convert-sorted-array-to-binary-search-tree.go

@@ -0,0 +1,14 @@
+package medium
+
+func sortedArrayToBST(nums []int) *TreeNode {
+	if len(nums) == 0 {
+		return nil
+	}
+
+	mid := len(nums) / 2
+	return &TreeNode{
+		Val:   nums[mid],
+		Left:  sortedArrayToBST(nums[:mid]),
+		Right: sortedArrayToBST(nums[mid+1:]),
+	}
+}