Problem
1. Describe, in pseudo-code, an algorithm for computing the number of descendents of each node of a binary tree. The algorithm should be based on the Euler tour traversal.
2. Show how to use the Euler tour traversal to compute the level number, defined in Section 7.3.5, of each node in a binary tree T.