mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 00:25:22 +08:00
32 lines
571 B
Markdown
Executable File
32 lines
571 B
Markdown
Executable File
# [257. Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)
|
||
|
||
|
||
## 题目
|
||
|
||
Given a binary tree, return all root-to-leaf paths.
|
||
|
||
**Note:** A leaf is a node with no children.
|
||
|
||
**Example:**
|
||
|
||
Input:
|
||
|
||
1
|
||
/ \
|
||
2 3
|
||
\
|
||
5
|
||
|
||
Output: ["1->2->5", "1->3"]
|
||
|
||
Explanation: All root-to-leaf paths are: 1->2->5, 1->3
|
||
|
||
## 题目大意
|
||
|
||
给定一个二叉树，返回所有从根节点到叶子节点的路径。说明: 叶子节点是指没有子节点的节点。
|
||
|
||
## 解题思路
|
||
|
||
- Google 的面试题，考察递归
|
||
|