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

Update construct_tree_inorder_postorder.py

Browse Source
This commit is contained in:
bt3gl 2023-07-30 15:51:43 -07:00 committed by GitHub
parent 0526bb7aee
commit 38cbe1c55b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 15 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
trees_and_graphs/construct_tree_inorder_postorder.py
View File

@ -1,25 +1,29 @@
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# author: bt3gl
# Given two integer arrays inorder and postorder where inorder is the inorder # Given two integer arrays inorder and postorder where inorder is the inorder
# traversal of a binary tree and postorder is the postorder traversal of the # traversal of a binary tree and postorder is the postorder traversal of the
# same tree, construct and return the binary tree. # same tree, construct and return the binary tree.
def build_tree(inorder: list[int], postorder: list[int]) -> Optional[TreeNode]:
def fill_tree(i_left, i_right, inorder_map):
def fill_tree(i_left, i_right, inorder_map):
if i_left > i_right: if i_left > i_right:
return None return None
val = postorder.pop() val = postorder.pop()
root = TreeNode(val) root = TreeNode(val)
index_here = inorder_map[val] index_here = inorder_map[val]
root.right = fill_tree(index_here + 1, i_right, inorder_map) root.right = fill_tree(index_here + 1, i_right, inorder_map)
root.left = fill_tree(i_left, index_here - 1, inorder_map) root.left = fill_tree(i_left, index_here - 1, inorder_map)
return root return root
def build_tree(inorder: list[int], postorder: list[int]) -> Optional[TreeNode]:
inorder_map = {val: index for index, val in enumerate(inorder)} inorder_map = {val: index for index, val in enumerate(inorder)}
return fill_tree(0, len(inorder) - 1, inorder_map) return fill_tree(0, len(inorder) - 1, inorder_map)