Maximum Difference Between Node and Ancestor

Given the root of a binary tree, find the maximum value V for which there exists different nodes A and B where V = |A.val - B.val| and A is an ancestor of B.

Ada AI

I want to discuss a solution

Help me solve this

Give more examples

What's wrong with my code?

How to use 'for loop' in javascript?

javascript (node 13.12.0)

Stdin (editable)

Maximum Difference Between Node and Ancestorself.__wrap_b(":R159l76:",1)

Maximum Difference Between Node and Ancestor