題目

https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/

題解

經典二分，不解釋了，直接看代碼

/*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode right;* TreeNode() {}* TreeNode(int val) { this.val = val; }* TreeNode(int val, TreeNode left, TreeNode right) {* this.val = val;* this.left = left;* this.right = right;* }* }*/ class Solution {public TreeNode sortedArrayToBST(int[] nums) {return process(nums, 0, nums.length - 1);}public TreeNode process(int[] nums, int L, int R) {if (L > R) return null;int M = L + ((R - L) >> 1);TreeNode root = new TreeNode(nums[M]);root.left = process(nums, L, M - 1);root.right = process(nums, M + 1, R);return root;} }

總結

以上是生活随笔為你收集整理的leetcode 108. Convert Sorted Array to Binary Search Tree | 108. 将有序数组转换为二叉搜索树（Java）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。