leetcode/ConvertSortedArraytoBinarySearchTree.java at master · fifa0329/leetcode

22 lines (20 loc) · 725 Bytes

/**

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

public class ConvertSortedArraytoBinarySearchTree {

public TreeNode sortedArrayToBST(int[] num) {

return sortedArrayToBST(num, 0, num.length - 1);

}

public TreeNode sortedArrayToBST(int[] num, int start, int end) {

if (start <= end) {

int mid = (start + end) / 2;

TreeNode left = sortedArrayToBST(num, start, mid - 1);

TreeNode right = sortedArrayToBST(num, mid + 1, end);

TreeNode node = new TreeNode(num[mid]);

node.left = left;

node.right = right;

return node;

}

return null;

}

Provide feedback