Sorted Array to Completed BST
Problem
Given a sorted array. Write a function that creates a Balanced Binary Search Tree using array elements.
Examples
Input: Array {1, 2, 3}
Output: A Balanced BST
2
/ \
1 3
Input: Array {1, 2, 3, 4}
Output: A Balanced BST
3
/
原创
2021-06-19 09:51:24 ·
182 阅读 ·
0 评论