# Given a binary tree, find the shortest path from the root to a leaf.

Aced (formerly Exponent) publishes a public search API over its indexed pages; the guide is at https://www.aced.io/agents/agent-access.

Source: https://www.aced.io/questions/6324/find-shortest-path-binary-tree
Source observed: 2026-11-05T00:44:21.930Z
Last checked: 2026-11-05T00:44:21.93+00:00
Indexed: 2026-11-06T16:33:57.01+00:00

---

# Given a binary tree, find the shortest path from the root to a leaf.

We provide this interview-question page for practicing data structures and algorithms and coding interviews. The question is associated with the **Software Engineer** role, **Microsoft**, and the categories **Data Structures & Algorithms** and **Coding**.

## Interview experience

One shared experience is associated with this question:

- **Microsoft · 7 months ago** — A Software Engineer, Mid Level / L4, described a process beginning with a HackerRank, followed by a one-hour recruiter screen focused on motivation and culture fit, and then three back-to-back interviews covering coding, system design, and low-level design. The interviewer used vague prompts that required clarifying questions. In the coding round, the candidate felt the reasoning process mattered more than using exact BFS or DFS terminology. The overall difficulty felt similar to Google or Amazon, with more emphasis on logical thinking and culture. [Read the full Microsoft experience](https://www.aced.io/experiences/microsoft-software-engineer-interview-ca84de).

## Community answers

No community answers have been contributed yet. You can log in or sign up to submit an answer. Submitting marks the question complete.

## Related questions

- [Given the root of a binary tree of integers, return the maximum path sum.](https://www.aced.io/questions/4342/binary-tree-maximum-path-sum)
- [Find the shortest path in a graph.](https://www.aced.io/questions/2094/find-shortest-path-graph)
- [Given the root of a binary tree, return the length of the diameter of the tree.](https://www.aced.io/questions/2705/binary-tree-diameter-length)

## Related courses

### [Software Engineering Interview Prep](https://www.aced.io/courses/software-engineering)

Land a software engineering role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Practice data structures, algorithms, system design, people management, behavioral interviews, and more through mock interviews, frameworks, and advice from senior candidates.

![Software Engineering Interview Prep](https://images.ctfassets.net/x78yjrjc11pq/4VkuYewBHUFIVUS5oJDW5h/02e833439b1289f25f38f13f81cbdca3/adobe_stock_optimized.jpeg?w=800&h=800&fm=webp&q=75)

### [System Design Interviews](https://www.aced.io/courses/system-design-interviews)

Learn to answer current system design questions across product, infrastructure, and AI domains with in-depth video examples, written breakdowns, reference patterns, and mock interview videos featuring senior engineers and managers.

![System Design Interviews](https://images.ctfassets.net/x78yjrjc11pq/78x7miFZFjBCrM5GqftrMJ/2f6d26e632c4e7265c49f6a180227edb/system_design_track_compressed_26ac98a46e__281_29_5be2280f31.jpeg?w=800&h=800&fm=webp&q=75)

## Practice and access

Detailed company statistics are available through [Upgrade](https://www.aced.io/upgrade?src=questions). Use the answer area to submit a response, or log in or sign up when prompted.

---

[Read this page’s summary](https://www.aced.io/agents/api/public/v1/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F6324%2Ffind-shortest-path-binary-tree&trace=t_679ff9ab98f3)

## Ask a follow-up about this page

Need a more specific answer? Ask the exact question you have. It returns a fresh, cited answer from Aced (formerly Exponent)’s knowledge base. No account or API key required.

Open this URL with your own question, URL-encoded. Include your question in q. All research inputs are optional; no account or setup.

`GET https://www.aced.io/agents/agent/faq?q={question}&trace=t_679ff9ab98f3`

[Tool guide and examples](https://www.aced.io/agents/agent-access) · [OpenAPI](https://www.aced.io/agents/api/public/v1/openapi.json) · [Page TLDR form](https://www.aced.io/agents/agent-tools/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F6324%2Ffind-shortest-path-binary-tree). Opening a form does not execute a tool.