From a00735fbaceb24195fa57a2b7b88bc144c0bf5c4 Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Wed, 26 Nov 2025 20:57:36 -0500
Subject: [PATCH] Create README - LeetHub

---
 .../README.md                                 | 31 +++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 0103-binary-tree-zigzag-level-order-traversal/README.md

diff --git a/0103-binary-tree-zigzag-level-order-traversal/README.md b/0103-binary-tree-zigzag-level-order-traversal/README.md
new file mode 100644
index 0000000..fcd20aa
--- /dev/null
+++ b/0103-binary-tree-zigzag-level-order-traversal/README.md
@@ -0,0 +1,31 @@
+<h2><a href="https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal">103. Binary Tree Zigzag Level Order Traversal</a></h2><h3>Medium</h3><hr><p>Given the <code>root</code> of a binary tree, return <em>the zigzag level order traversal of its nodes&#39; values</em>. (i.e., from left to right, then right to left for the next level and alternate between).</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg" style="width: 277px; height: 302px;" />
+<pre>
+<strong>Input:</strong> root = [3,9,20,null,null,15,7]
+<strong>Output:</strong> [[3],[20,9],[15,7]]
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> root = [1]
+<strong>Output:</strong> [[1]]
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> root = []
+<strong>Output:</strong> []
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The number of nodes in the tree is in the range <code>[0, 2000]</code>.</li>
+	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
+</ul>