← Samsung questions
CodingReported in a candidate post, Aug 2018

Minimum jumps between two nodes in a binary tree

Filed under Samsung

Given the root of a binary tree and the values of two nodes, find the minimum number of jumps or edges needed to reach the second node from the first node.

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 Samsung questions

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