feat: add LeetCode 106 solution and disable MD040 in markdownlint

Author: myoshi2891

.markdownlint.json

@@ -49,7 +49,7 @@
     "MD034": false,
     "MD036": false,
     "MD038": true,
-    "MD040": true,
+    "MD040": false,
     "MD041": false,
     "MD042": false,
     "MD046": { "style": "fenced" },

Algorithm/BinaryTree/claude sonnet 4.6 extended/106. Construct Binary Tree from Inorder and Postorder Traversal/Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal_Python.md

@@ -416,7 +416,7 @@ <h1 class="site-title">
             🧪 Algorithm Study
             <span class="title-accent">Index</span>
         </h1>
-        <p class="site-subtitle">172 interactive lessons across 6 domains</p>
+        <p class="site-subtitle">173 interactive lessons across 6 domains</p>
     </header>
 
     <div class="search-container">
@@ -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">172</span>
+            <span class="tab-icon">🌍</span> All <span class="tab-count">173</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">94</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">95</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>
@@ -471,6 +471,7 @@ <h1 class="site-title">
 <li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/claude%20sonnet%204.6%20extended/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README_React.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 103 – Binary Tree Zigzag Level Order Traversal</span></span><span class="file-path">Algorithm/BinaryTree/claude sonnet 4.6 extended/103. Binary Tree Zigzag Level Order Traversal/README_React.html</span></a></li>
 <li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/claude%20sonnet%204.6%20extended/104.%20Maximum%20Depth%20of%20Binary%20Tree/README_React.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 104 · Maximum Depth of Binary Tree</span></span><span class="file-path">Algorithm/BinaryTree/claude sonnet 4.6 extended/104. Maximum Depth of Binary Tree/README_React.html</span></a></li>
 <li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/claude%20sonnet%204.6%20extended/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README_React.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 105 – Construct Binary Tree from Preorder and Inorder Traversal</span></span><span class="file-path">Algorithm/BinaryTree/claude sonnet 4.6 extended/105. Construct Binary Tree from Preorder and Inorder Traversal/README_React.html</span></a></li>
+<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/claude%20sonnet%204.6%20extended/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/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/claude sonnet 4.6 extended/106. Construct Binary Tree from Inorder and Postorder Traversal/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>
@@ -650,6 +651,7 @@ <h1 class="site-title">
 <li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/claude%20sonnet%204.6%20extended/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal/README_React.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 103 – Binary Tree Zigzag Level Order Traversal</span></span><span class="file-path">Algorithm/BinaryTree/claude sonnet 4.6 extended/103. Binary Tree Zigzag Level Order Traversal/README_React.html</span></a></li>
 <li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/claude%20sonnet%204.6%20extended/104.%20Maximum%20Depth%20of%20Binary%20Tree/README_React.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 104 · Maximum Depth of Binary Tree</span></span><span class="file-path">Algorithm/BinaryTree/claude sonnet 4.6 extended/104. Maximum Depth of Binary Tree/README_React.html</span></a></li>
 <li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/claude%20sonnet%204.6%20extended/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README_React.html"><span class="card-header"><span class="card-icon">🧩</span><span class="card-title">LeetCode 105 – Construct Binary Tree from Preorder and Inorder Traversal</span></span><span class="file-path">Algorithm/BinaryTree/claude sonnet 4.6 extended/105. Construct Binary Tree from Preorder and Inorder Traversal/README_React.html</span></a></li>
+<li class="file-item" data-category="algorithm"><a class="file-link" href="Algorithm/BinaryTree/claude%20sonnet%204.6%20extended/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/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/claude sonnet 4.6 extended/106. Construct Binary Tree from Inorder and Postorder Traversal/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>
@@ -827,7 +829,7 @@ <h1 class="site-title">
 
     <footer>
         <span class="footer-icon">🧪</span>
-        Generated on 2026-04-22
+        Generated on 2026-04-26
     </footer>
 
     <script>