Disk Storage

You are given an undirected tree with n nodes numbered from 0 to n - 1, rooted at node 0. Every node contains one lowercase English letter.

For each query node u, count how many nodes v o...