Company: grow_25sep
Difficulty: medium
Trees: Max Binary Path Problem Description There are N cities and (N-1) roads connecting them. The cities and the roads together form a tree-like structure. Each city has a binary value of either 0 or 1. Ben starts the tour from starting city and he can visit any other city that he has not visited before and if there exists a direct road from the current city. The tour ends when he reaches the ending city. During the tour from the starting city to the ending city, Ben notes the values of the cities (either 0 or 1) he visits. At the end of the tour, he defines the value of the tour as the decimal representation of the binary string he noted down in the tour. Find the binary representation of the value which is the maximum value of the tour that Ben can take. Note: There is the possibility that multiple tours have the same value, print the one which is the longest. Function Description In the provided code snippet, implement the provided findMax(...) method using the variables to print t