BYJU'S SDE OA (2023) | Binary Tree Analysis | Maximum Wealth Collection | Java Solutions

Q1. Network Reach Analysis Problem Statement A company maintains a hierarchical network represented as a binary tree. The efficiency of communication between two offices is measured by the number of connections (edges) on the path between them. Find the maximum communication distance possible between any two offices in the network. The path may or may not pass through the head office (root). Example Input         1        / \       2   3 ...