binary-tree-paths

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>root</code> of a binary tree, return all root-to-leaf paths in any order.

A leaf is a node with no children.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/12/paths-tree.jpg" style="width: 207px; height: 293px;" />
<pre>
Input: root = [1,2,3,null,5]
Output: [&quot;1-&gt;2-&gt;5&quot;,&quot;1-&gt;3&quot;]
</pre>

Example 2:

<pre>
Input: root = [1]
Output: [&quot;1&quot;]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[1, 100]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>

binaryTreePaths

Binary Tree Paths

Path Sum II

path-sum-ii

路径总和 II

Smallest String Starting From Leaf

smallest-string-starting-from-leaf

从叶结点开始的最小字符串

Step-By-Step Directions From a Binary Tree Node to Another

step-by-step-directions-from-a-binary-tree-node-to-another

从二叉树一个节点到另一个节点每一步的方向

Tree

Depth-First Search

String

Backtracking

Binary Tree

给你一个二叉树的根节点 <code>root</code> ，按 任意顺序 ，返回所有从根节点到叶子节点的路径。

叶子节点 是指没有子节点的节点。
&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/12/paths-tree.jpg" style="width: 207px; height: 293px;" />
<pre>
输入：root = [1,2,3,null,5]
输出：["1-&gt;2-&gt;5","1-&gt;3"]
</pre>

示例 2：

<pre>
输入：root = [1]
输出：["1"]
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点的数目在范围 <code>[1, 100]</code> 内</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>