DIY: Maximum Difference Between Node and Ancestor
We'll cover the following
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 - ...
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Devpath's Terms of Service and Privacy Policy