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?
Help in finding maximum possible diameter of a tree
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?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | CrazyCircle | 2020-11-08 10:26:02 | 251 | Initial revision (published) |