알고리즘
[Leetcode/Python] Convert Sorted Array to Binary Search Tree
Top Interview Questions 의 Easy Collection에 있는 문제입니다. 문제는 여기서 볼 수 있습니다. Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree. Example 1: Input: nums = [-10,-3,0,5,9] Output: [0,-3,9,-10,null,5] Explanation: [0,-10,5,null,-3,null,9] is also accepted: Example 2: Input: nums = [1,3] Output: [3,1] Explanation: [1,null,3] and ..
2022. 11. 17. 07:57