The authors study protected nodes in various classes of random rooted trees by putting them in the general context of fringe subtrees. Several types of random trees are considered: simply generated trees (or conditioned Galton-Watson trees), binary search trees and random recursive trees. This gives unified and simple proofs of several earlier results, as well as new results.