Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.

# Give an O ( n )-time algorithm for computing the depth of each node of a tree T , where n is the number of nodes of T .

Give an O(n)-time algorithm for computing the depth of each node of a tree T, where n is the number of nodes of T. Assume the existence of methods setDepth (v,d) and getDepth(v) that run in O(1) time.