# Are these trees useful and how are they named in the literature

I am working in a project with trees and it turns out that the specific problem I am trying to attack is easy on some types of trees. If we consider the rooted layout of the tree with the root being the center (or one of the centers if there are two) then each vertex of each level (except the last one) has at least a child which is leaf.

A more specific structure within this class would be those trees which look like the following example.

Is there any name for these kind of trees? And most importantly, are these structures useful in computer science or in any other science?

Theorem (Dirac). If $G$ is a chordal graph, then either $G$ is complete or it has a clique cutset.
From these decomposition theorems, we can construct decomposition trees. Say we wish to find a minimum vertex colouring of a graph $G$. Then we can construct a decomposition tree whose root is the original graph $G$, and whose children are so-called blocks of decomposition. This is repeated until we obtain (induced sub-)graphs that have no clique cutset. These are called atoms, and are the leaves of the tree. To solve the vertex colouring problem, we can solve it on these atoms and then propagate the result up to the top of the tree - to the original graph.
Knowing the structure of this decomposition tree is useful - it tells us that there are at most $n-1$ leaves in a clique cutset decomposition tree for a graph on $n$ vertices.