Highest Subtree Density

In a BST, the 'Density' of a node is defined as the sum of all node values in its subtree divided by the number of nodes in that subtree. Build a BST from a sequence of unique integers. Find the node with the highest Density. If multiple nodes have the same density, output the one with the largest value. Input Format: - A space-separated list of integers. Output Format: - The value of the node with the maximum density (rounded to 2 decimal places if it were a float, but here just print the integer value of the node itself). Example: Input: 10 5 15 Output: 15 Explanation: Node 10: (10+5+15)/3 = 10. Node 5: 5/1 = 5. Node 15: 15/1 = 15. Max is 15.