[LeetCode] 108. Convert Sorted Array to Binary Search Tree, Easy
·
CodingTest/LeetCode
1. 문제오름차순 정렬된 배열이 주어질 때, 균형잡인 BST 를 구성하라.2. 해결/** * Definition for a binary tree node. * class TreeNode { * val: number * left: TreeNode | null * right: TreeNode | null * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { * this.val = (val===undefined ? 0 : val) * this.left = (left===undefined ? null : left) * this.right = (right=..