JAVA_Convert Sorted Array to Binary Search Tree_LeetCode 108


JAVA_Convert Sorted Array to Binary Search Tree_LeetCode 108

JAVA_Convert Sorted Array to Binary Search Tree_LeetCode 108 Convert Sorted Array to Binary Search Tree 풀이 class Solution { public TreeNode sortedArrayToBST(int[] nums) { return addNode(nums, 0, nums.length - 1); } public TreeNode addNode(int[] nums, int left, int right) { if (left > right) return null; int mid = left + ((right - left) / 2); TreeNode tree = new TreeNode(nums[mid]); tree.left = addNode(nums, left, mid - 1); tree.right = addNode(nums, mid + 1, right); return tree; } } * 출처 Level u...


#ConvertSortedArraytoBinarySearchTree_LeetCode108 #JAVA #JAVA_ConvertSortedArraytoBinarySearchTree #JAVA_ConvertSortedArraytoBinarySearchTree_LeetCode108 #JAVA_LeetCode108

원문링크 : JAVA_Convert Sorted Array to Binary Search Tree_LeetCode 108