In this paper, we enumerate the cardinalities for the set of all vertices of outdegree ≥ k at level ≥ ℓ among all rooted ordered d-trees with n edges. Our results unite and generalize several previous works in the literature.