Given a network of N interconnected server, represented as a binary tree. Each server is assigned an integer value that represents the amount of data it stores. Determine the maximum amount of data that can be transferred by selecting a path from any server to another server within the network. The path can traverse any number of servers, but it must follow the connections between them.Input: Single line of integers representing the interconnected servers Output: Value representing maximum transferrable dataSample Testcase $14261357$Output :$22$Sample Testcase $2$: $52-313-64$Output: $11$Constraints. O$<=$N$<=1000.-1000<=$ Node.val $<=1000$Given a network of N interconnected server, represented as a binary tree. Each server is assigned an integer value that represents the amount of data it stores. Determine the maximum amount of data that can be transferred by selecting a path from any server to another server within the network. The path can traverse any number of servers, but it must follow the connections between them.Input: Single line of integers representing the interconnected servers Output: Value representing maximum transferrable dataSample Testcase $14261357$Output :$22$Sample Testcase $2$: $52-313-64$Output: $11$Constraints. O$<=$N$<=1000.-1000<=$ Node.val $<=1000$