Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update trie_find_height.py

Browse Source
This commit is contained in:
bt3gl 2023-08-08 16:59:52 -07:00 committed by GitHub
parent 761e86705f
commit a97c06f579
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 9 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
tries/trie_find_height.py
View File

@ -15,25 +15,27 @@ def max_depth_recursive(root):
if root is None: if root is None:
return 0 return 0
if root.children == []: if root.children: is None:
return 1 return 1
height = [max_depth_recursive(c) for c in root.children] height = [max_depth_recursive(children) for children in root.children]
return max(height) + 1 return max(height) + 1
def max_depth_iterative(root): def max_depth_iterative(root):
stack = [] stack, depth = [], 0
if root is not None: if root is not None:
stack.append((1, root)) stack.append((1, root))
depth = 0 while stack:
while stack != []:
this_depth, node = stack.pop() this_depth, node = stack.pop()
if node is not None: if node is not None:
depth = max(depth, this_depth) depth = max(depth, this_depth)
for c in node.children: for c in node.children:
stack.append((this_depth + 1, c)) stack.append((this_depth + 1, c))