โ† OYO questions

Split binary tree into equal sum parts

Filed under OYO

Given a binary tree, determine if there exists an edge removal that splits the tree into two separate trees with equal sum of node values.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.