feat: update dict tree

Author: wislertt

.templates/leetcode/json/implement_trie_prefix_tree.json

@@ -14,9 +14,14 @@
     ],
     "readme_constraints": "- `1 <= word.length, prefix.length <= 2000`\n- `word` and `prefix` consist only of lowercase English letters.\n- At most `3 * 10^4` calls **in total** will be made to `insert`, `search`, and `starts_with`.",
     "readme_additional": "",
-    "solution_imports": "from leetcode_py.data_structures import DictTree",
+    "solution_imports": "from leetcode_py.data_structures import DictTree, RecursiveDict",
     "solution_methods": [
-        { "name": "__init__", "parameters": "", "return_type": "None", "dummy_return": "" },
+        {
+            "name": "__init__",
+            "parameters": "",
+            "return_type": "None",
+            "dummy_return": "super().__init__()\n        self.root: RecursiveDict[str] = {}"
+        },
         { "name": "insert", "parameters": "word: str", "return_type": "None", "dummy_return": "" },
         { "name": "search", "parameters": "word: str", "return_type": "bool", "dummy_return": "False" },
         {

leetcode/implement_trie_prefix_tree/playground.ipynb

@@ -60,7 +60,7 @@
   {
    "cell_type": "code",
    "execution_count": 5,
-   "id": "f3bac41e",
+   "id": "c8308208",
    "metadata": {},
    "outputs": [
     {
@@ -170,7 +170,7 @@
        "</svg>\n"
       ],
       "text/plain": [
-       "<solution.Trie at 0x10406a270>"
+       "<solution.Trie at 0x10771dfd0>"
       ]
      },
      "execution_count": 5,
@@ -207,7 +207,7 @@
    "file_extension": ".py",
    "mimetype": "text/x-python",
    "name": "python",
-   "nbconvert_exporter": "python3",
+   "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
    "version": "3.13.7"
   }

leetcode/implement_trie_prefix_tree/solution.py

@@ -1,6 +1,4 @@
-from typing import Any
-
-from leetcode_py.data_structures import DictTree
+from leetcode_py.data_structures import DictTree, RecursiveDict
 
 
 class Trie(DictTree[str]):
@@ -9,7 +7,7 @@ class Trie(DictTree[str]):
     # Time: O(1)
     # Space: O(1)
     def __init__(self) -> None:
-        self.root: dict[str, Any] = {}
+        self.root: RecursiveDict[str] = {}
 
     # Time: O(m) where m is word length
     # Space: O(m)
@@ -19,7 +17,7 @@ def insert(self, word: str) -> None:
             if char not in node:
                 node[char] = {}
             node = node[char]
-        node[self.END_OF_WORD] = True  # End of word marker
+        node[self.END_OF_WORD] = True
 
     # Time: O(m) where m is word length
     # Space: O(1)

leetcode/lowest_common_ancestor_of_a_binary_tree/tests.py

@@ -16,6 +16,14 @@ def setup_method(self):
             ([3, 5, 1, 6, 2, 0, 8, None, None, 7, 4], 5, 1, 3),
             ([3, 5, 1, 6, 2, 0, 8, None, None, 7, 4], 5, 4, 5),
             ([1, 2], 1, 2, 1),
+            ([3, 5, 1, 6, 2, 0, 8, None, None, 7, 4], 6, 7, 5),
+            ([3, 5, 1, 6, 2, 0, 8, None, None, 7, 4], 7, 4, 2),
+            ([3, 5, 1, 6, 2, 0, 8, None, None, 7, 4], 0, 8, 1),
+            ([1], 1, 1, 1),
+            ([2, 1, 3], 1, 3, 2),
+            ([6, 2, 8, 0, 4, 7, 9, None, None, 3, 5], 2, 8, 6),
+            ([6, 2, 8, 0, 4, 7, 9, None, None, 3, 5], 3, 5, 4),
+            ([6, 2, 8, 0, 4, 7, 9, None, None, 3, 5], 0, 3, 2),
         ],
     )
     @logged_test

leetcode_py/data_structures/__init__.py

@@ -1,6 +1,6 @@
-from .dict_tree import DictTree
+from .dict_tree import DictTree, RecursiveDict
 from .graph_node import GraphNode
 from .list_node import ListNode
 from .tree_node import TreeNode
 
-__all__ = ["DictTree", "GraphNode", "ListNode", "TreeNode"]
+__all__ = ["DictTree", "GraphNode", "ListNode", "RecursiveDict", "TreeNode"]

leetcode_py/data_structures/dict_tree.py

@@ -1,19 +1,20 @@
-from typing import Any, Generic, Hashable, TypeVar
+from typing import Any, Generic, Hashable, TypeAlias, TypeVar
 
 K = TypeVar("K", bound=Hashable)
+RecursiveDict: TypeAlias = dict[K, "RecursiveDict[K] | Any"]
 
 
 class DictTree(Generic[K]):
 
     def __init__(self) -> None:
-        self.root: dict[K, Any] = {}
+        self.root: RecursiveDict[K] = {}
 
     def __str__(self) -> str:
         if not hasattr(self, "root") or not self.root:
             return "Empty"
         return self._render_dict_tree(self.root)
 
-    def _render_dict_tree(self, node: dict[K, Any], prefix: str = "", depth: int = 0) -> str:
+    def _render_dict_tree(self, node: RecursiveDict[K], prefix: str = "", depth: int = 0) -> str:
         if not node:
             return ""
 
@@ -49,7 +50,9 @@ def _repr_html_(self) -> str:
         self._add_dict_nodes(dot, self.root, "root")
         return dot.pipe(format="svg", encoding="utf-8")
 
-    def _add_dict_nodes(self, dot: Any, node: dict[K, Any], node_id: str, char: K | str = "") -> None:
+    def _add_dict_nodes(
+        self, dot: Any, node: RecursiveDict[K], node_id: str, char: K | str = ""
+    ) -> None:
         if not node:
             return