Pattern-based verification trying to abstract away the concrete number
of repeated memory structures is one of the approaches that have
recently been proposed for verification of programs using dynamic data
structures linked with pointers. It proved to be very efficient and
promising on extended linear data structures. In this paper, we
overview some possibilities how to extend this approach to programs
over tree structures.