DIY: Maximum Difference Between Node and Ancestor

Problem statement

Given the root of a binary tree, find the maximum value, X, for which there exist two different nodes, A and B. X = |A.val ...