mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-08 23:05:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added new case in insert function

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-14 22:43:31 +05:30
parent e9e7c96465
commit 7e994ff238
1 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
data_structures/trie/radix_tree.py
View File

@ -62,12 +62,17 @@ class RadixNode:
-- A (leaf) -- A (leaf)
--- A (leaf) --- A (leaf)
""" """
# Case 1: If the word is the prefix of the node # Case 1: If the word is empty, mark current node as leaf
if not word:
self.is_leaf = True
return
# Case 2: If the word is the prefix of the node
# Solution: We set the current node as leaf # Solution: We set the current node as leaf
if self.prefix == word and not self.is_leaf: if self.prefix == word and not self.is_leaf:
self.is_leaf = True self.is_leaf = True
# Case 2: The node has no edges that have a prefix to the word # Case 3: The node has no edges that have a prefix to the word
# Solution: We create an edge from the current node to a new one # Solution: We create an edge from the current node to a new one
# containing the word # containing the word
elif word[0] not in self.nodes: elif word[0] not in self.nodes:
@ -79,12 +84,12 @@ class RadixNode:
word word
) )
# Case 3: The node prefix is equal to the matching # Case 4: The node prefix is equal to the matching
# Solution: We insert remaining word on the next node # Solution: We insert remaining word on the next node
if remaining_prefix == "": if remaining_prefix == "":
self.nodes[matching_string[0]].insert(remaining_word) incoming_node.insert(remaining_word)
# Case 4: The word is greater equal to the matching # Case 5: The word is greater equal to the matching
# Solution: Create a node in between both nodes, change # Solution: Create a node in between both nodes, change
# prefixes and add the new node for the remaining word # prefixes and add the new node for the remaining word
else: else: