[leetcode] Binary Search (TreeNode)
108. Convert Sorted Array to Binary Search Tree 이진 탐색 알고리즘 문제 풀이 재귀함수 사용 class Solution { public TreeNode sortedArrayToBST(int[] nums) { return loop(nums, 0, nums.length - 1); } private TreeNode loop(int[] nums, int left, int right) { if (left > right) { return null; } int mid = (left + right) / 2; TreeNode root = new TreeNode(nums[mid]); root.left = loop(nums, left, mid - 1); root.right = loop(..