in DS recategorized by
477 views
1 vote
1 vote
Worst case time required to construct a balanced BST given a sorted array of integers which can be inserted in any order

 

in DS recategorized by
by
477 views

1 comment

1 Answer

1 vote
1 vote
Best answer

We can perform Inorder traversal in O(n) time and construct BST.

selected by

Related questions