feat(Trees): add 101. Symmetric Tree implementation and fix README

Author: myoshi2891

DataStructures/Trees/Other/101. Symmetric Tree/claude sonnet 4.6 extended/README.md

@@ -115,7 +115,7 @@ for a, b in edges:
 
 📌 各タプルに対し `adj[a-1][b-1] = 1` & `adj[b-1][a-1] = 1`
 
-### 🔍 各ステップを図で見る：
+### 🔍 各ステップを図で見る
 
 #### ✅ (1, 2) 処理後
 

DataStructures/Trees/Other/101. Symmetric Tree/claude sonnet 4.6 extended/README_react.html

@@ -416,7 +416,7 @@ <h1 class="site-title">
             🧪 Algorithm Study
             <span class="title-accent">Index</span>
         </h1>
-        <p class="site-subtitle">167 interactive lessons across 6 domains</p>
+        <p class="site-subtitle">168 interactive lessons across 6 domains</p>
     </header>
 
     <div class="search-container">
@@ -431,11 +431,11 @@ <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">167</span>
+            <span class="tab-icon">🌍</span> All <span class="tab-count">168</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">90</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">35</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>
 <button type="button" class="tab-button" data-category="mathematics" data-tab-target="Mathematics"><span class="tab-icon">📐</span> Mathematics <span class="tab-count">16</span></button>
 <button type="button" class="tab-button" data-category="sql" data-tab-target="SQL"><span class="tab-icon">🗃️</span> SQL <span class="tab-count">6</span></button>
@@ -552,6 +552,7 @@ <h1 class="site-title">
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Stacks/leetcode/84.%20Largest%20Rectangle%20in%20Histogram/Claude/README_tailwind.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">Largest Rectangle in Histogram - 単調スタックアルゴリズム解説（Tailwind CDN リファクタ）</span></span><span class="file-path">DataStructures/Stacks/leetcode/84. Largest Rectangle in Histogram/Claude/README_tailwind.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Stacks/leetcode/84.%20Largest%20Rectangle%20in%20Histogram/GPT/README_tailwind.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">Largest Rectangle in Histogram — 技術解説（単調増加スタック法 / Python, Tailwind版）</span></span><span class="file-path">DataStructures/Stacks/leetcode/84. Largest Rectangle in Histogram/GPT/README_tailwind.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Stacks/leetcode/84.%20Largest%20Rectangle%20in%20Histogram/GPT/README.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">Largest Rectangle in Histogram — 技術解説（単調増加スタック法 / Python）</span></span><span class="file-path">DataStructures/Stacks/leetcode/84. Largest Rectangle in Histogram/GPT/README.html</span></a></li>
+<li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Trees/Other/101.%20Symmetric%20Tree/claude%20sonnet%204.6%20extended/README_react.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">LeetCode #101 Symmetric Tree — 完全解説</span></span><span class="file-path">DataStructures/Trees/Other/101. Symmetric Tree/claude sonnet 4.6 extended/README_react.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Trees/BFS%E3%83%BBDFS/leetcode/87.%20Scramble%20String/Claude/README.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">LeetCode 87: Scramble String - Top-down Memoized DFS</span></span><span class="file-path">DataStructures/Trees/BFS・DFS/leetcode/87. Scramble String/Claude/README.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Trees/BFS%E3%83%BBDFS/leetcode/87.%20Scramble%20String/GPT/README.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">LeetCode 87: Scramble String — Top-down recursion with memoization &amp; pruning</span></span><span class="file-path">DataStructures/Trees/BFS・DFS/leetcode/87. Scramble String/GPT/README.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/LinkedLists/leetcode/92.%20Reverse%20Linked%20List%20II/Claude/README.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">LeetCode 92: Reverse Linked List II - 部分区間反転アルゴリズム</span></span><span class="file-path">DataStructures/LinkedLists/leetcode/92. Reverse Linked List II/Claude/README.html</span></a></li>
@@ -736,6 +737,7 @@ <h1 class="site-title">
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Stacks/leetcode/84.%20Largest%20Rectangle%20in%20Histogram/Claude/README_tailwind.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">Largest Rectangle in Histogram - 単調スタックアルゴリズム解説（Tailwind CDN リファクタ）</span></span><span class="file-path">DataStructures/Stacks/leetcode/84. Largest Rectangle in Histogram/Claude/README_tailwind.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Stacks/leetcode/84.%20Largest%20Rectangle%20in%20Histogram/GPT/README_tailwind.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">Largest Rectangle in Histogram — 技術解説（単調増加スタック法 / Python, Tailwind版）</span></span><span class="file-path">DataStructures/Stacks/leetcode/84. Largest Rectangle in Histogram/GPT/README_tailwind.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Stacks/leetcode/84.%20Largest%20Rectangle%20in%20Histogram/GPT/README.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">Largest Rectangle in Histogram — 技術解説（単調増加スタック法 / Python）</span></span><span class="file-path">DataStructures/Stacks/leetcode/84. Largest Rectangle in Histogram/GPT/README.html</span></a></li>
+<li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Trees/Other/101.%20Symmetric%20Tree/claude%20sonnet%204.6%20extended/README_react.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">LeetCode #101 Symmetric Tree — 完全解説</span></span><span class="file-path">DataStructures/Trees/Other/101. Symmetric Tree/claude sonnet 4.6 extended/README_react.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Trees/BFS%E3%83%BBDFS/leetcode/87.%20Scramble%20String/Claude/README.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">LeetCode 87: Scramble String - Top-down Memoized DFS</span></span><span class="file-path">DataStructures/Trees/BFS・DFS/leetcode/87. Scramble String/Claude/README.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/Trees/BFS%E3%83%BBDFS/leetcode/87.%20Scramble%20String/GPT/README.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">LeetCode 87: Scramble String — Top-down recursion with memoization &amp; pruning</span></span><span class="file-path">DataStructures/Trees/BFS・DFS/leetcode/87. Scramble String/GPT/README.html</span></a></li>
 <li class="file-item" data-category="datastructures"><a class="file-link" href="DataStructures/LinkedLists/leetcode/92.%20Reverse%20Linked%20List%20II/Claude/README.html"><span class="card-header"><span class="card-icon">🏗️</span><span class="card-title">LeetCode 92: Reverse Linked List II - 部分区間反転アルゴリズム</span></span><span class="file-path">DataStructures/LinkedLists/leetcode/92. Reverse Linked List II/Claude/README.html</span></a></li>
@@ -817,7 +819,7 @@ <h1 class="site-title">
 
     <footer>
         <span class="footer-icon">🧪</span>
-        Generated on 2026-03-19
+        Generated on 2026-03-20
     </footer>
 
     <script>