Array to BST
Easy Accuracy: 53.32% Submissions: 90 Points: 2

Given a sorted array. Convert it into a Height balanced Binary Search Tree (BST).
Height balanced BST means a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example 1:

Input: nums = {1,2,3,4,5,6,7}
Ouput: {4,2,1,3,6,5,7}
Explanation: The possible answer is:
{4,2,1,3,6,5,7} which is the preorder
traversal of theheight balanced BST:
       / \
      2   6
     / \  / \
    1   3 5  7

Your Task:
You don't need to read or print anything. Your task is to complete the function sortedArrayToBST() which takes nums as input paramater and returns the preorder traversal of height balanced BST.

Expected Time Complexity: O(n)
Expected Space Complexity: O(n)

1 ≤ |nums| ≤ 104
-104 ≤ nums[i] ≤ 104


to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Array to BST

Output Window