Atlassian·Machine Learning Engineer·Technical Phone Screen
- Given the root of a binary tree and two node values p and q, return their lowest common ancestor only if both nodes actually exist in the tree. If either is missing, return null.
“This is LC 1644, the nastier sibling of the standard LCA problem.”