Given a graph H and a family of graphs F, we define the generalized Turan number ex(n,H,F) to be the maximum number of copies of H in an F-free graph on n vertices.  We prove a  ``stability'' type result for generalized Turan problems which relates the generalized Turan number ex(n,H,F)  to the classical Turan number ex(n,F) whenever H is a tree. We discuss some applications of this result, as well as some related work around the rational exponents conjecture for general graphs H.  Joint work with Sean English.