Register

Applied Test Series

• recategorized by
499 views
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

 

• recategorized by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
LRU asked Nov 22, 2021
850 views
Applied Grand Test 2
Number different of binary search trees which can be created with the elements {12, 34, 22, 43, 13, 45, 55, 94, 99, 23} with 45 as the root is___.
Number different of binary search trees which can be created with the elements {12, 34, 22, 43, 13, 45, 55, 94, 99, 23} with 45 as the root is___.
User Avatar
1 votes
1 votes
1 answer
2
Sagar475 asked Jan 21, 2022
684 views
Gate Applied Test Series
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element is _______.(Assume that we are allowed to access the array indexes)
A min heap of size 2048 is stored on an array with array indices [1..2048] is stored and the minimum number of comparisons required to determine the maximum of element i...
User Avatar
2 votes
2 votes
1 answer
3
LRU asked Nov 3, 2021
843 views
Applied Test Series
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
User Avatar
0 votes
0 votes
2 answers
4
rsansiya111 asked Nov 2, 2022
1,249 views
GATE CS Applied Course Test Series
In the GO back N ARQ sender is sending the 15 packets to the destination with a window size of 5.Assume every sixth packet while transmission is lost. How many transmissions will there be?
In the GO back N ARQ sender is sending the 15 packets to the destination with a window size of 5.Assume every sixth packet while transmission is lost. How many transmiss...
User Avatar
Link Copied!