Gate CS-2006 Question Paper With Solutions

Q. 2 In a binary max heap containing n numbers, the smallest element can be found in time

Gate CS-2006 Question Paper With Solutions

Answer: (A)

Explanation: Gate CS-2006 Question Paper With Solutions

Learn More:   Gate EC-2015 - 2 Question Paper With Solutions

RELATED ARTICLESMORE FROM AUTHOR

LEAVE A REPLY

Please enter your comment!
Please enter your name here