《LeetCode力扣练习》代码随想录——二叉树（将有序数组转换为二叉搜索树---Java）

《LeetCode力扣练习》代码随想录——二叉树（将有序数组转换为二叉搜索树—Java）

---

---

刷题思路来源于 代码随想录

---

108. 将有序数组转换为二叉搜索树

• 二叉树-递归

  /**
   * 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 recursion(nums, 0, nums.length - 1);
  
      }
  
      private TreeNode recursion(int[] nums, int left, int right) {
  
          if (left > right) {
              return null;
          }
  
          int mid = left + (right - left) / 2;
          TreeNode root = new TreeNode(nums[mid]);
  
          root.left = recursion(nums, left, mid - 1);
          root.right = recursion(nums, mid + 1, right);
  
          return root;
  
      }
  }
  

---