1 1 vote Worst case time required to construct a balanced BST given a sorted array of integers which can be inserted in any order Data Structures data-structures binary-search-tree applied-gate-test-series + – LRU 905 views answer comment Share Follow Print See 1 comment 1 1 comment reply ganesh gaitonde commented Jan 8, 2022 reply Follow flag https://www.geeksforgeeks.org/sorted-array-to-balanced-bst/ 1 1 replyShare Please log in or register to add a comment.
Best answer 1 1 vote 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 0 reply Please log in or register to add a comment.