Compute shortest path between two tree nodes

Q: Compute shortest path between two tree nodes

This is a Coding & Algorithms interview question from Snowflake for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Given a binary tree (not necessarily a BST) and two node values u and v, implement a function that returns the shortest path between them as a list of node values. Optimize for multiple queries by describing preprocessing strategies (e.g., storing parent pointers, Euler tour + RMQ LCA, or binary lifting). Discuss time/space trade-offs and how to handle missing nodes, duplicate values, and very deep trees.

Compute shortest path between two tree nodes

Comments (0)