Register

Made-easy test series

274 views

1 Answer

0 votes
0 votes
How to upload image here?
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
3 answers
1
Mrityudoot asked Jan 20
250 views
Made Easy Test Series
In a max heap of n elements, the time complexity to find 10th largest element is: a)Θ(n log n) b)Θ(n) c)Θ(1) d)Θ(log n) I personally think it should be Θ(n), as the 10th largest element can be anywhere in the heap, all the elements need to be traversed once to decide that.
In a max heap of n elements, the time complexity to find 10th largest element is:a)Θ(n log n)b)Θ(n)c)Θ(1)d)Θ(log n) I personally think it should be Θ(n), as the 10th...
User Avatar
0 votes
0 votes
1 answer
2
atulcse asked Jan 16, 2022
712 views
max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.
Consider the following graph:Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the ...
User Avatar
3 votes
3 votes
5 answers
3
srestha asked May 22, 2019
1,842 views
Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________
Consider the following function height, to which pointer to the root node of a binary tree shown below is passedNote that max(a,b) defined by #define max(a,b) (a>b)?a:b.i...
User Avatar
Link Copied!