A labeled tree is a tree in which each vertex is given a unique label. The vertices of a labeled tree on vertices (for nonnegative integers ) are typically given the labels . A recursive tree is a labeled rooted tree where the vertex labels respect the tree order (i.e., if for two vertices and , then the label of is smaller than the label of ).
A labeled tree is a tree in which each vertex is given a unique label. The vertices of a labeled tree on vertices (for nonnegative integers ) are typically given the labels . A recursive tree is a labeled rooted tree where the vertex labels respect the tree order (i.e., if for two vertices and , then the label of is smaller than the label of )