Problem
1. The path length of a tree T is the sum of the depths of all the nodes in T. Describe a linear-time method for computing the path length of a tree T (which is not necessarily binary).
2. Implement the binary tree ADT using an array list.
3. Implement the tree ADT using a linked structure.