We are given an array A of size n ( n <= 1000) , where A[i] = number of nodes in the level i of the tree.
Given this information, what is the maximum possible diameter of the tree. Can anyone help?
We are given an array A of size n ( n <= 1000) , where A[i] = number of nodes in the level i of the tree.
Given this information, what is the maximum possible diameter of the tree. Can anyone help?