leetcode 108. Convert Sorted Array to Binary Search Tree | 108. 将有序数组转换为二叉搜索树（Java）

小鱼儿 2022-09-01 09:09 154阅读 0赞

## 题目 ##

[https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/][https_leetcode.com_problems_convert-sorted-array-to-binary-search-tree]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70]

## 题解 ##

经典二分，不解释了，直接看代码

/** * 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;
        }
    }

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 1]

[https_leetcode.com_problems_convert-sorted-array-to-binary-search-tree]: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70]: /images/20220829/8474b9dba78e44158481aa029f7f2462.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3NpbmF0XzQyNDgzMzQx_size_16_color_FFFFFF_t_70 1]: /images/20220829/ff5a67620af44f4dba6ae10e67f4f9c5.png