Generally, when recursion is introduced to students the concept is illustrated with a toy (Towers of Hanoi) and some abstract mathematical functions (factorial, power, Fibonacci). These illustrate recursion in the same sense that counting to 10 can be used to illustrate a for loop. These are all good illustrations, but do not represent serious applications of recursion. Many of the most important applications of recursion occur on methods of lists, trees and graphs. These data structures are usually presented within the computer science sequences between computer science 2 and algorithms. This paper demonstrates an alternative approach to recursion that combines recursive data with recursive methods. Thus, the recursion will be built into the data structures themselve and the advantages of object-oriented programming will be apparent with this approach to recursion.