myoshi2891 · myoshi2891 · May 8, 2026 · May 7, 2026 · May 7, 2026 · May 7, 2026
diff --git a/.htmlhintrc b/.htmlhintrc
@@ -0,0 +1,3 @@
+{
+  "spec-char-escape": false
+}
diff --git a/...claude sonnet 4.6 adaptive/Convert_Sorted_Array_to_Binary_Search_Tree_Python.md b/...claude sonnet 4.6 adaptive/Convert_Sorted_Array_to_Binary_Search_Tree_Python.md
diff --git a/...e/claude sonnet 4.6 adaptive/Convert_Sorted_Array_to_Binary_Search_Tree_Rust.md b/...e/claude sonnet 4.6 adaptive/Convert_Sorted_Array_to_Binary_Search_Tree_Rust.md
diff --git a/...de sonnet 4.6 adaptive/Convert_Sorted_Array_to_Binary_Search_Tree_Typescript.md b/...de sonnet 4.6 adaptive/Convert_Sorted_Array_to_Binary_Search_Tree_Typescript.md
diff --git a/...Convert Sorted Array to Binary Search Tree/claude sonnet 4.6 adaptive/README.md b/...Convert Sorted Array to Binary Search Tree/claude sonnet 4.6 adaptive/README.md
diff --git a/.... Convert Sorted Array to Binary Search Tree/claude sonnet 4.6 adaptive/README_react.html b/.... Convert Sorted Array to Binary Search Tree/claude sonnet 4.6 adaptive/README_react.html
diff --git a/...nary_Tree_Level_Order_Traversal_Python.md → ...nary_Tree_Level_Order_Traversal_Python.md b/...nary_Tree_Level_Order_Traversal_Python.md → ...nary_Tree_Level_Order_Traversal_Python.md
diff --git a/...Binary_Tree_Level_Order_Traversal_Rust.md → ...Binary_Tree_Level_Order_Traversal_Rust.md b/...Binary_Tree_Level_Order_Traversal_Rust.md → ...Binary_Tree_Level_Order_Traversal_Rust.md
diff --git a/..._Tree_Level_Order_Traversal_Typescript.md → ..._Tree_Level_Order_Traversal_Typescript.md b/..._Tree_Level_Order_Traversal_Typescript.md → ..._Tree_Level_Order_Traversal_Typescript.md
diff --git a/...nary Tree Level Order Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md b/...nary Tree Level Order Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md
diff --git a/...e Level Order Traversal/README_react.html → ...ude sonnet 4.6 extended/README_react.html b/...e Level Order Traversal/README_react.html → ...ude sonnet 4.6 extended/README_react.html
@@ -326,7 +326,7 @@ <h1 class="outfit text-4xl font-black text-teal-900 mb-1 leading-tight">
 
 
 class Solution:
-    def levelOrder(self, root: Optional[TreeNode]) -> list[list[int]]:
+    def levelOrder(self, root: Optional[TreeNode]) -&gt; list[list[int]]:
         # 基底条件: root が None（空ツリー）なら即座に空リストを返す
         # None チェックをしないと後続の node.val アクセスでクラッシュする
         if root is None:

diff --git a/...ee_Zigzag_Level_Order_Traversal_Python.md → ...ee_Zigzag_Level_Order_Traversal_Python.md b/...ee_Zigzag_Level_Order_Traversal_Python.md → ...ee_Zigzag_Level_Order_Traversal_Python.md
diff --git a/...Tree_Zigzag_Level_Order_Traversal_Rust.md → ...Tree_Zigzag_Level_Order_Traversal_Rust.md b/...Tree_Zigzag_Level_Order_Traversal_Rust.md → ...Tree_Zigzag_Level_Order_Traversal_Rust.md
diff --git a/...igzag_Level_Order_Traversal_Typescript.md → ...igzag_Level_Order_Traversal_Typescript.md b/...igzag_Level_Order_Traversal_Typescript.md → ...igzag_Level_Order_Traversal_Typescript.md
diff --git a/...ee Zigzag Level Order Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md b/...ee Zigzag Level Order Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md
diff --git a/...g Level Order Traversal/README_React.html → ...ude sonnet 4.6 extended/README_React.html b/...g Level Order Traversal/README_React.html → ...ude sonnet 4.6 extended/README_React.html
diff --git a/...ee/Maximum_Depth_of_Binary_Tree_Python.md → ...ed/Maximum_Depth_of_Binary_Tree_Python.md b/...ee/Maximum_Depth_of_Binary_Tree_Python.md → ...ed/Maximum_Depth_of_Binary_Tree_Python.md
diff --git a/...Tree/Maximum_Depth_of_Binary_Tree_Rust.md → ...nded/Maximum_Depth_of_Binary_Tree_Rust.md b/...Tree/Maximum_Depth_of_Binary_Tree_Rust.md → ...nded/Maximum_Depth_of_Binary_Tree_Rust.md
diff --git a/...aximum_Depth_of_Binary_Tree_Typescript.md → ...aximum_Depth_of_Binary_Tree_Typescript.md b/...aximum_Depth_of_Binary_Tree_Typescript.md → ...aximum_Depth_of_Binary_Tree_Typescript.md
diff --git a/...4. Maximum Depth of Binary Tree/README.md → ...Tree/claude sonnet 4.6 extended/README.md b/...4. Maximum Depth of Binary Tree/README.md → ...Tree/claude sonnet 4.6 extended/README.md
diff --git a/...um Depth of Binary Tree/README_React.html → ...ude sonnet 4.6 extended/README_React.html b/...um Depth of Binary Tree/README_React.html → ...ude sonnet 4.6 extended/README_React.html
@@ -292,7 +292,7 @@ <h1 class="outfit text-[2.2rem] font-extrabold text-teal-900 mb-1 leading-tight"
 # 業務開発版：反復 BFS（CPython 再帰制限を回避）
 # ════════════════════════════════════════════════
 class Solution:
-    def maxDepth(self, root: Optional[TreeNode]) -> int:
+    def maxDepth(self, root: Optional[TreeNode]) -&gt; int:
         # エッジケース：空の木（ノードが1つもない）→ 深さ 0
         # 後続の deque 処理に None を入れないための早期リターン
         if root is None:
@@ -329,7 +329,7 @@ <h1 class="outfit text-[2.2rem] font-extrabold text-teal-900 mb-1 leading-tight"
 # 競技プログラミング版：再帰 DFS（最もシンプル）
 # ════════════════════════════════════════════════
 class Solution2:
-    def maxDepth(self, root: Optional[TreeNode]) -> int:
+    def maxDepth(self, root: Optional[TreeNode]) -&gt; int:
         # ベースケース：None = 存在しないノードの深さは 0
         # "is None" を使う理由：
         #   通常のノードオブジェクトはvalの値にかかわらずtruthyですが、

diff --git a/..._Preorder_and_Inorder_Traversal_Python.md → ..._Preorder_and_Inorder_Traversal_Python.md b/..._Preorder_and_Inorder_Traversal_Python.md → ..._Preorder_and_Inorder_Traversal_Python.md
diff --git a/...om_Preorder_and_Inorder_Traversal_Rust.md → ...om_Preorder_and_Inorder_Traversal_Rust.md b/...om_Preorder_and_Inorder_Traversal_Rust.md → ...om_Preorder_and_Inorder_Traversal_Rust.md
diff --git a/...order_and_Inorder_Traversal_Typescript.md → ...order_and_Inorder_Traversal_Typescript.md b/...order_and_Inorder_Traversal_Typescript.md → ...order_and_Inorder_Traversal_Typescript.md
diff --git a/... Preorder and Inorder Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md b/... Preorder and Inorder Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md
diff --git a/...r and Inorder Traversal/README_React.html → ...ude sonnet 4.6 extended/README_React.html b/...r and Inorder Traversal/README_React.html → ...ude sonnet 4.6 extended/README_React.html
diff --git a/...Inorder-and-Postorder-Traversal_Python.md → ...Inorder-and-Postorder-Traversal_Python.md b/...Inorder-and-Postorder-Traversal_Python.md → ...Inorder-and-Postorder-Traversal_Python.md
diff --git a/...m-Inorder-and-Postorder-Traversal_Rust.md → ...m-Inorder-and-Postorder-Traversal_Rust.md b/...m-Inorder-and-Postorder-Traversal_Rust.md → ...m-Inorder-and-Postorder-Traversal_Rust.md
diff --git a/...der-and-Postorder-Traversal_TypeScript.md → ...der-and-Postorder-Traversal_TypeScript.md b/...der-and-Postorder-Traversal_TypeScript.md → ...der-and-Postorder-Traversal_TypeScript.md
diff --git a/...Inorder and Postorder Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md b/...Inorder and Postorder Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md
diff --git a/...and Postorder Traversal/README_React.html → ...ude sonnet 4.6 extended/README_React.html b/...and Postorder Traversal/README_React.html → ...ude sonnet 4.6 extended/README_React.html
diff --git a/...110. Balanced Binary Tree/claude sonnet 4.6 adaptive/Balanced_Binary_Tree_Go.md b/...110. Balanced Binary Tree/claude sonnet 4.6 adaptive/Balanced_Binary_Tree_Go.md
diff --git a/... Balanced Binary Tree/claude sonnet 4.6 adaptive/Balanced_Binary_Tree_Python.md b/... Balanced Binary Tree/claude sonnet 4.6 adaptive/Balanced_Binary_Tree_Python.md
diff --git a/...0. Balanced Binary Tree/claude sonnet 4.6 adaptive/Balanced_Binary_Tree_Rust.md b/...0. Balanced Binary Tree/claude sonnet 4.6 adaptive/Balanced_Binary_Tree_Rust.md
diff --git a/...anced Binary Tree/claude sonnet 4.6 adaptive/Balanced_Binary_Tree_Typescript.md b/...anced Binary Tree/claude sonnet 4.6 adaptive/Balanced_Binary_Tree_Typescript.md
diff --git a/...aryTree/leetcode/110. Balanced Binary Tree/claude sonnet 4.6 adaptive/README.md b/...aryTree/leetcode/110. Balanced Binary Tree/claude sonnet 4.6 adaptive/README.md
diff --git a/...inaryTree/leetcode/110. Balanced Binary Tree/claude sonnet 4.6 adaptive/README_react.html b/...inaryTree/leetcode/110. Balanced Binary Tree/claude sonnet 4.6 adaptive/README_react.html
diff --git a/...sal/Binary_Tree_Inorder_Traversal_Rust.md → ...ded/Binary_Tree_Inorder_Traversal_Rust.md b/...sal/Binary_Tree_Inorder_Traversal_Rust.md → ...ded/Binary_Tree_Inorder_Traversal_Rust.md
diff --git a/...l/Binary_Tree_Inorder_Traversal_python.md → ...d/Binary_Tree_Inorder_Traversal_python.md b/...l/Binary_Tree_Inorder_Traversal_python.md → ...d/Binary_Tree_Inorder_Traversal_python.md
diff --git a/...nary_Tree_Inorder_Traversal_typescript.md → ...nary_Tree_Inorder_Traversal_typescript.md b/...nary_Tree_Inorder_Traversal_typescript.md → ...nary_Tree_Inorder_Traversal_typescript.md
diff --git a/.... Binary Tree Inorder Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md b/.... Binary Tree Inorder Traversal/README.md → ...rsal/claude sonnet 4.6 extended/README.md
diff --git a/... Tree Inorder Traversal/README_react.html → ...ude sonnet 4.6 extended/README_react.html b/... Tree Inorder Traversal/README_react.html → ...ude sonnet 4.6 extended/README_react.html
diff --git a/.... Convert Sorted Array to Binary Search Tree/claude sonnet 4.6 adaptive/README_react.html b/.... Convert Sorted Array to Binary Search Tree/claude sonnet 4.6 adaptive/README_react.html
diff --git a/...gorithm/BinaryTree/claude sonnet 4.6 adaptive/110. Balanced Binary Tree/README_react.html b/...gorithm/BinaryTree/claude sonnet 4.6 adaptive/110. Balanced Binary Tree/README_react.html
diff --git a/...tcode/102. Binary Tree Level Order Traversal/claude sonnet 4.6 extended/README_react.html b/...tcode/102. Binary Tree Level Order Traversal/claude sonnet 4.6 extended/README_react.html
diff --git a/...03. Binary Tree Zigzag Level Order Traversal/claude sonnet 4.6 extended/README_React.html b/...03. Binary Tree Zigzag Level Order Traversal/claude sonnet 4.6 extended/README_React.html
diff --git a/...e/leetcode/104. Maximum Depth of Binary Tree/claude sonnet 4.6 extended/README_React.html b/...e/leetcode/104. Maximum Depth of Binary Tree/claude sonnet 4.6 extended/README_React.html
diff --git a/...ary Tree from Preorder and Inorder Traversal/claude sonnet 4.6 extended/README_React.html b/...ary Tree from Preorder and Inorder Traversal/claude sonnet 4.6 extended/README_React.html
diff --git a/...ry Tree from Inorder and Postorder Traversal/claude sonnet 4.6 extended/README_React.html b/...ry Tree from Inorder and Postorder Traversal/claude sonnet 4.6 extended/README_React.html
diff --git a/...inaryTree/leetcode/110. Balanced Binary Tree/claude sonnet 4.6 adaptive/README_react.html b/...inaryTree/leetcode/110. Balanced Binary Tree/claude sonnet 4.6 adaptive/README_react.html
diff --git a/...e/leetcode/94. Binary Tree Inorder Traversal/claude sonnet 4.6 extended/README_react.html b/...e/leetcode/94. Binary Tree Inorder Traversal/claude sonnet 4.6 extended/README_react.html
diff --git a/public/index.html b/public/index.html