Based on the methodology we presented in earlier work on parameterized algorithms for 3-HITTING SET, we develop simple search tree-based algorithms for d-HITTING SET. We considerably improve on the bounds that were elsewhere derived for these problems.