title: tree questions to find diameter given number of nodes at each level
body: <p>Suppose at the first level of a tree a root node is always present. You are given an array count where count[i] denotes the number of nodes present at the ith level. We need to output the maximum diameter(number of edges in the longest path) possible for this tree</p>