DS |GATE-2019| Data Structures
1. Let T be a full binary tree with 8 leaves. (A full binary tree has every level full). Suppose two leaves a and b of T are chosen uniformly and independently at random. The expected value of the distance between a and b in T (i.e., the number of edges in the unique path between a and b) is (rounded off to 2 decimal places) _____. [GATE – 2019]
a. 5.54
b. 1.34
c. 3.82
d. 4.25
Answer : d)
DS |GATE-2019|