give binary tree root node X tree name good path root X node value great XReturn number good nod binary tree Example 1input root 3143null15output 4explanation Nodes blue goodroot Node 3 good nodenode 4 34 maximum value path start rootNode 5 345 maximum value pathnode 3 313 maximum value pathexample 2input root 33null42output 3explanation Node 2 3 3 2 good 3 high itexample 3input root 1output 1explanation Root consider good ConstraintsThe number nod binary tree range 1 105each node value 104 104