 Binary tree of finite strings

A binary tree of finite strings is a set of finite binary strings closed under taking prefixes. The empty tree is allowed; a nonempty such tree contains the empty string. Finite nodes may have no infinite extensions. Such presentations describe closed subsets of Cantor space through their infinite paths.