MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized in Data Structures and Algorithms
→
What is order of resultant heap after merging two ..
1.
What is order of resultant heap after merging two tree of order k?
A.
2*k
B.
k+1
C.
k*k
D.
k+logk
Answer» D. k+logk
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What will be the order of new heap created after union of heap H1 and H2 when created by the following code.Initially both are of the order n.
What is wrong with the following code of insertion in fibonacci heap.Choose the correct option
The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.
Which of these operations have same complexities?
What does this pseudo_code return ?
Given the pseudo code, state whether the function for merging of two heap is correct or not?
LAST_ADDED_ELEMENT_TO_HEAP?$
The Statement “Fibonacci heap has better amortized running time in compare to a binomial heap”.$#
Which of these operations have same complexities?$
Choose the option with function having same complexity for a fibonacci heap.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply