Range trees can be used for solving a number of problems in databases and other applications. We study the problem of storing range trees in secondary memory. To this end, we have to partition range trees into parts that can be stored in consecutive blocks in secondary memory. A number of partition schemes will be presented that limit the part sizes and the number of disk accesses necessary for performing updates and queries. Matching lower bounds will be proven as well.