Skip to content

Commit 85e48dc

Browse files
committed
Create README - LeetHub
1 parent b5058dd commit 85e48dc

File tree

1 file changed

+25
-0
lines changed

1 file changed

+25
-0
lines changed

0257-binary-tree-paths/README.md

Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
<h2><a href="https://leetcode.com/problems/binary-tree-paths/">257. Binary Tree Paths</a></h2><h3>Easy</h3><hr><div><p>Given the <code>root</code> of a binary tree, return <em>all root-to-leaf paths in <strong>any order</strong></em>.</p>
2+
3+
<p>A <strong>leaf</strong> is a node with no children.</p>
4+
5+
<p>&nbsp;</p>
6+
<p><strong class="example">Example 1:</strong></p>
7+
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/12/paths-tree.jpg" style="width: 207px; height: 293px;">
8+
<pre><strong>Input:</strong> root = [1,2,3,null,5]
9+
<strong>Output:</strong> ["1-&gt;2-&gt;5","1-&gt;3"]
10+
</pre>
11+
12+
<p><strong class="example">Example 2:</strong></p>
13+
14+
<pre><strong>Input:</strong> root = [1]
15+
<strong>Output:</strong> ["1"]
16+
</pre>
17+
18+
<p>&nbsp;</p>
19+
<p><strong>Constraints:</strong></p>
20+
21+
<ul>
22+
<li>The number of nodes in the tree is in the range <code>[1, 100]</code>.</li>
23+
<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
24+
</ul>
25+
</div>

0 commit comments

Comments
 (0)