GATE | GATE MOCK 2017 | Question 45

Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest element at the last level ?

(A) 1/2
(B) 1
(C) 1/n
(D) 1/2^n

Answer: (B)
Explanation:

Always 1 as maximum element will always be present in the leaf nodes in case of binary min heap.

Quiz of this Question

Article Tags :

GATE

GATE 2017 Mock

GATE-GATE 2017 Mock

Recommended Articles

1. GATE | GATE MOCK 2017 | Question 1

2. GATE | GATE MOCK 2017 | Question 2

3. GATE | GATE MOCK 2017 | Question 3

4. GATE | GATE MOCK 2017 | Question 4

5. GATE | GATE MOCK 2017 | Question 5

6. GATE | GATE MOCK 2017 | Question 6

7. GATE | GATE MOCK 2017 | Question 7

8. GATE | GATE MOCK 2017 | Question 8

9. GATE | GATE MOCK 2017 | Question 9

10. GATE | GATE MOCK 2017 | Question 10

11. GATE | GATE MOCK 2017 | Question 11

12. GATE | GATE MOCK 2017 | Question 12

13. GATE | GATE MOCK 2017 | Question 13

14. GATE | GATE MOCK 2017 | Question 14

15. GATE | GATE MOCK 2017 | Question 15

16. GATE | GATE MOCK 2017 | Question 16

17. GATE | GATE MOCK 2017 | Question 17

18. GATE | GATE MOCK 2017 | Question 18

19. GATE | GATE MOCK 2017 | Question 19

20. GATE | GATE MOCK 2017 | Question 20

21. GATE | GATE MOCK 2017 | Question 21

22. GATE | GATE MOCK 2017 | Question 22

23. GATE | GATE MOCK 2017 | Question 23

24. GATE | GATE MOCK 2017 | Question 24

25. GATE | GATE MOCK 2017 | Question 25