Find Node to Split Tree into Three Subtrees
Filed under Directi
The question
Given a binary tree and three nodes a, b, and c, find a node such that removing all its edges results in three different trees containing a, b, and c respectively.
No write-up yet. Related questions below have one.
Related Directi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.