Trees: Strings on trees

Problem Statement

Trees: Strings on trees Problem Description You are given a binary tree with N nodes, each node containing a digit 0-9. You have to start from any of the nodes and move to any of its descendant leaf nodes, i.e., you always have to move towards the leaf node from the current node. While traversing on such a path, you will concatenate the digits. Find the maximum integer you can generate by concatenating digits in this way on any of the possible paths. Note: No node will have the same digit in both of their child nodes. The nodes are given in the form of a list, where (2*i+1)th and (2*i+2)th position in the list. Function Description: In the provided code snippet, implement the provided maximumInteger(...) method which returns the maximum integer that can be made as mentioned in the problem statement. You can write your code in the space below the phrase "WRITE YOUR LOGIC HERE". There will be multiple test cases running so the input and Output should match exactly as provided. The base O