Convert Sorted Array to Binary Search Tree

最新推荐文章于 2022-02-19 22:56:38 发布

最新推荐文章于 2022-02-19 22:56:38 发布 · 64 阅读

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种将有序数组转换为高度平衡二叉搜索树(BST)的方法。通过递归地选择中间元素作为根节点，并将左右两侧的子数组分别转换为左子树和右子树，可以确保树的高度平衡。

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode sortedArrayToBST(int[] nums) {
        return solve(nums, 0, nums.length-1);
    }

	private TreeNode solve(int[] nums, int s, int e) {
		if (s > e) {
			return null;
		}
		int mid = (s+e)/2;
		TreeNode root = new TreeNode(nums[mid]);
		root.left = solve(nums, s, mid-1);
		root.right = solve(nums, mid+1, e);
		return root;
	}
}