Let π be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves π and π of π are chosen uniformly and independently at random
Q. Let π be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves π and π of π are chosen uniformly and independently at random. The expected value of the distance between π and π in π (i.e., the number of edges in the unique path […]










