Depth First Search Algorithm to Find the Largest Difference Between Node and a Descendant in a Binary Tree
Given a binary tree root, return the largest absolute difference between any node and its descendants. For example, given the following tree: 0 / \ 4 2 / \ …