Unrooted binary tree enumeration problem on unrooted binary trees is to count the number of trees with "n" labeled leaves and unlabeled internal nodes. An unrooted binary tree on "n" labeled leaves can be formed by connecting the "n"th leaf to a new node in the middle of any of the edges of an unrooted binary tree on "n" − 1 labeled leaves. There are 2"n" − 5 edges at which the "n"th node can be attached; therefore, the number of trees on "n" leaves is larger than the number of trees on "n" − 1 leaves by a factor of 2"n" −
Compound File Binary Format Binary Format is a container, with little restriction on what can be stored within it. A CFBF file structure loosely resembles a FAT filesystem. The file is partitioned into "Sectors" which are chained together with a "File Allocation Table" (not to be mistaken with the file system of the same name) which contains chains of sectors related to each file, a "Directory" holds information for contained files with a Sector ID (SID) for the starting sector of a chain and so on. The CFBF file consists of a 512-Byte header record followed by a number of sectors whose size is