1 votes 1 votes Worst case time required to construct a balanced BST given a sorted array of integers which can be inserted in any order DS data-structures binary-search-tree applied-gate-test-series + – LRU asked Oct 4, 2021 • recategorized Jul 6, 2022 by Lakshman Bhaiya LRU 506 views answer comment Share Follow See 1 comment See all 1 1 comment reply ganesh gaitonde commented Jan 8, 2022 reply Follow Share https://www.geeksforgeeks.org/sorted-array-to-balanced-bst/ 1 votes 1 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes We can perform Inorder traversal in O(n) time and construct BST. Aashay kaurav answered Oct 7, 2021 • selected Jan 3, 2022 by LRU Aashay kaurav comment Share Follow See all 0 reply Please log in or register to add a comment.