108. Convert Sorted Array to Binary Search Tree
# Easy
Finding medium of a sorted list to be root and add to root.left
and root.right
respectively. Use recursive.
Last updated
# Easy
Finding medium of a sorted list to be root and add to root.left
and root.right
respectively. Use recursive.
Last updated
Time complexity = , space complexity = because only need to record the root.