Given a rooted tree T=(V,E),check if two vertices are on the same level

Question

Given a rooted tree T=(V,E).

How to construct an algorithm that checks whether two vertices u, v∈V are at the same level in T or not?And what is the time complexity a