C-Programming-data-structure || 2019 NAT || 2-mark || Module 3: Tree | Graph | Hashing

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) ___________ 2019 NAT || 2-mark