Convert Sorted Array to Binary Search Tree

dihu6677

于 2017-08-17 22:53:00 发布

阅读量85

点赞数

原文链接：http://www.cnblogs.com/GodBug/p/7384875.html

版权

本文介绍了一种将排序数组转换为高度平衡二叉搜索树的方法。通过递归地选择中间元素作为根节点，确保了树的高度平衡。代码示例展示了如何实现这一转换。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

public TreeNode sortedArrayToBST(int[] num) {
    if (num.length == 0) {
        return null;
    }
    TreeNode head = helper(num, 0, num.length - 1);
    return head;
}

public TreeNode helper(int[] num, int low, int high) {
    if (low > high) { 
        return null;
    }
    int mid = (low + high) / 2;
    TreeNode node = new TreeNode(num[mid]);
    node.left = helper(num, low, mid - 1);
    node.right = helper(num, mid + 1, high);
    return node;
}

转载于:https://www.cnblogs.com/GodBug/p/7384875.html