A query tree represents a relational algebra expression as a tree. The leaves are relations, the internal nodes are operators, and the root represents the final result. Each operator takes its input from the branches below it, so the tree is read from the bottom up.
The tree above corresponds to:
π Code, Name, PName ( σ Semester = 2 ( COURSES ) ⋈ PROFESSORS )