We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its principal ideals are labeled by partial parking functions. We establish that it is a graded lattice and compute its Möbius function and characteristic polynomials.