In this talk I’ll introduce a new random tree model that associates a family of probability distributions on binary trees to each binary tree shape. We’ll then use this new model, convex geometry, and the combinatorics of multisets and trees to obtain a finite form of a deFinetti-type theorem for rooted binary trees. This talk will be accessible to all undergraduate and graduate students.