> Consider the binary tree in which every right child has a child and > every left child is a terminal node. > > Then there is in it for each member of |N a left terminal node having > that path length, and an infinite path of all right nodes to represent > the set |N itself, having one node at each length in |N.
Creepy. An infinitely long centipede with only left legs.
Consider a trinary tree in which every middle child has a child and every left and right child is a terminal node.