# What, if any, is the term for a node whose children are all leaf nodes?

More specifically, I'm interested to know if there is a term that describes a tree node that meets two conditions: - It has >= one child - Any children that it has are all leaf nodes.

• Maybe penultimate node?
– orlp
Jan 4 '19 at 16:52

The height of a node $$N$$ is the number of edges on the longest downward simple path from $$N$$ to a leaf, according to Introduction to Algorithms by CLRS as well as the Wikipedia entry.