Largest Leaf Path Value Dictionary from Binary Tree Nodes

google You are given the root node of a binary tree. Return the largest number in the path from each node to its leaves as a dictionary. Example Input root = [3, [1, null, null], [4, [2, null, null], null]]