Hey can anyone help me to solve this question?

From the Adjacency matrix of a simple digraph how will you determine whether it’s directed tree ? If it is directed tree , how will you determine its root and terminal nodes?