Skip to content

Add LeetCode 111 (Minimum Depth of Binary Tree) implementation and documentation #338

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
myoshi2891 merged 2 commits into from
May 10, 2026
Merged

Add LeetCode 111 (Minimum Depth of Binary Tree) implementation and documentation #338

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
475f853
feat: add LeetCode 111 (Minimum Depth of Binary Tree) artifacts
myoshi2891 May 10, 2026
7d51252
build: auto-generate public directory
myoshi2891 May 10, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions .gitignore
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -104,3 +104,4 @@ node_modules/
package-lock.json

.claude/skills
prompt
348 changes: 348 additions & 0 deletions ...f Binary Tree/claude sonnet 4.6 adaptive/Minimum_Depth_of_Binary_Tree_Python.md
View file
Open in desktop

Large diffs are not rendered by default.

387 changes: 387 additions & 0 deletions ...nary Tree/claude sonnet 4.6 adaptive/Minimum_Depth_of_Binary_Tree_Typescript.md
View file
Open in desktop

Large diffs are not rendered by default.

862 changes: 862 additions & 0 deletions ...leetcode/111. Minimum Depth of Binary Tree/claude sonnet 4.6 adaptive/README.md
View file
Open in desktop

Large diffs are not rendered by default.

1,776 changes: 1,776 additions & 0 deletions ...e/leetcode/111. Minimum Depth of Binary Tree/claude sonnet 4.6 adaptive/README_react.html
View file
Open in desktop

Large diffs are not rendered by default.

1,776 changes: 1,776 additions & 0 deletions ...e/leetcode/111. Minimum Depth of Binary Tree/claude sonnet 4.6 adaptive/README_react.html
View file
Open in desktop

Large diffs are not rendered by default.

10 changes: 6 additions & 4 deletions public/index.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -416,7 +416,7 @@ <h1 class="site-title">
🧪 Algorithm Study
<span class="title-accent">Index</span>
</h1>
<p class="site-subtitle">175 interactive lessons across 6 domains</p>
<p class="site-subtitle">176 interactive lessons across 6 domains</p>
</header>

<div class="search-container">
Expand All @@ -431,9 +431,9 @@ <h1 class="site-title">

<div class="tabs" id="categoryTabs">
<button class="tab-button active" data-category="all" data-tab-target="All">
<span class="tab-icon">🌍</span> All <span class="tab-count">175</span>
<span class="tab-icon">🌍</span> All <span class="tab-count">176</span>
</button>
<button type="button" class="tab-button" data-category="algorithm" data-tab-target="Algorithm"><span class="tab-icon">🧩</span> Algorithm <span class="tab-count">97</span></button>
<button type="button" class="tab-button" data-category="algorithm" data-tab-target="Algorithm"><span class="tab-icon">🧩</span> Algorithm <span class="tab-count">98</span></button>
<button type="button" class="tab-button" data-category="concurrency" data-tab-target="Concurrency"><span class="tab-icon">⚡</span> Concurrency <span class="tab-count">6</span></button>
<button type="button" class="tab-button" data-category="datastructures" data-tab-target="DataStructures"><span class="tab-icon">🏗️</span> DataStructures <span class="tab-count">36</span></button>
<button type="button" class="tab-button" data-category="javascript" data-tab-target="JavaScript"><span class="tab-icon">📜</span> JavaScript <span class="tab-count">14</span></button>
Expand Down Expand Up @@ -474,6 +474,7 @@ <h1 class="site-title">
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/leetcode/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/claude%20sonnet%204.6%20extended/README_React.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 106 · Construct Binary Tree from Inorder and Postorder Traversal</span></span><span class="file-path">Algorithm/BinaryTree/leetcode/106. Construct Binary Tree from Inorder and Postorder Traversal/claude sonnet 4.6 extended/README_React.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinarySearch/leetcode/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/claude%20sonnet%204.6%20adaptive/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 108 - 昇順配列を高さ平衡BSTに変換</span></span><span class="file-path">Algorithm/BinarySearch/leetcode/108. Convert Sorted Array to Binary Search Tree/claude sonnet 4.6 adaptive/README_react.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/leetcode/110.%20Balanced%20Binary%20Tree/claude%20sonnet%204.6%20adaptive/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 110 · Balanced Binary Tree</span></span><span class="file-path">Algorithm/BinaryTree/leetcode/110. Balanced Binary Tree/claude sonnet 4.6 adaptive/README_react.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/leetcode/111.%20Minimum%20Depth%20of%20Binary%20Tree/claude%20sonnet%204.6%20adaptive/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 111 - Minimum Depth of Binary Tree | BFS解説</span></span><span class="file-path">Algorithm/BinaryTree/leetcode/111. Minimum Depth of Binary Tree/claude sonnet 4.6 adaptive/README_react.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/ExpandAroundCenter/leetcode/5.%20Longest%20Palindromic%20Substring/Claude/README.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 5: Longest Palindromic Substring - 中心展開法</span></span><span class="file-path">Algorithm/ExpandAroundCenter/leetcode/5. Longest Palindromic Substring/Claude/README.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/Other/leetcode/66.%20Plus%20One/Claude%20Sonnet%204.5/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 66: Plus One - 右から左への繰り上がり処理</span></span><span class="file-path">Algorithm/Other/leetcode/66. Plus One/Claude Sonnet 4.5/README_react.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/TwoPointers/leetcode/67.%20Add%20Binary/Claude/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 67: Add Binary - 二進数加算</span></span><span class="file-path">Algorithm/TwoPointers/leetcode/67. Add Binary/Claude/README_react.html</span></a></li>
Expand Down Expand Up @@ -656,6 +657,7 @@ <h1 class="site-title">
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/leetcode/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/claude%20sonnet%204.6%20extended/README_React.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 106 · Construct Binary Tree from Inorder and Postorder Traversal</span></span><span class="file-path">Algorithm/BinaryTree/leetcode/106. Construct Binary Tree from Inorder and Postorder Traversal/claude sonnet 4.6 extended/README_React.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinarySearch/leetcode/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree/claude%20sonnet%204.6%20adaptive/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 108 - 昇順配列を高さ平衡BSTに変換</span></span><span class="file-path">Algorithm/BinarySearch/leetcode/108. Convert Sorted Array to Binary Search Tree/claude sonnet 4.6 adaptive/README_react.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/leetcode/110.%20Balanced%20Binary%20Tree/claude%20sonnet%204.6%20adaptive/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 110 · Balanced Binary Tree</span></span><span class="file-path">Algorithm/BinaryTree/leetcode/110. Balanced Binary Tree/claude sonnet 4.6 adaptive/README_react.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/leetcode/111.%20Minimum%20Depth%20of%20Binary%20Tree/claude%20sonnet%204.6%20adaptive/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 111 - Minimum Depth of Binary Tree | BFS解説</span></span><span class="file-path">Algorithm/BinaryTree/leetcode/111. Minimum Depth of Binary Tree/claude sonnet 4.6 adaptive/README_react.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/ExpandAroundCenter/leetcode/5.%20Longest%20Palindromic%20Substring/Claude/README.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 5: Longest Palindromic Substring - 中心展開法</span></span><span class="file-path">Algorithm/ExpandAroundCenter/leetcode/5. Longest Palindromic Substring/Claude/README.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/Other/leetcode/66.%20Plus%20One/Claude%20Sonnet%204.5/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 66: Plus One - 右から左への繰り上がり処理</span></span><span class="file-path">Algorithm/Other/leetcode/66. Plus One/Claude Sonnet 4.5/README_react.html</span></a></li>
<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/TwoPointers/leetcode/67.%20Add%20Binary/Claude/README_react.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 67: Add Binary - 二進数加算</span></span><span class="file-path">Algorithm/TwoPointers/leetcode/67. Add Binary/Claude/README_react.html</span></a></li>
Expand Down Expand Up @@ -833,7 +835,7 @@ <h1 class="site-title">

<footer>
<span class="footer-icon">🧪</span>
Generated on 2026-05-08
Generated on 2026-05-10
</footer>

<script>
Expand Down