You can combine small-to-large with centroid decomposition for complex tree problems that require multiple passes or distance-based queries. You can use it with lazy propagation on sets for range updates on tree paths, though this is rare.
You can even apply it to non-tree structures like graphs with cycles, using a spanning tree. These advanced combinations are rare in contests, but understanding the basics prepares you for them if they appear. Learn the simple case first.