250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록Recursive (1)
N
(Leet Code c++)Convert Sorted Array to Binary Search Tree
108. Convert Sorted Array to Binary Search Tree Easy 4312293Add to ListShare Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree. A height-balanced binary tree is a binary tree in which the depth of the two subtrees of every node never differs by more than one. Example 1: Input: nums = [-10,-3,0,5,9] Output: [0,-3,9,-10..
Leet Code 알고리즘
2021. 7. 14. 11:45