mirror of
https://github.com/krahets/hello-algo.git
synced 2025-11-02 04:31:55 +08:00
Update preorder_traversal_iii.
This commit is contained in:
@ -9,7 +9,7 @@ from .list_node import (
|
||||
linked_list_to_list,
|
||||
get_list_node,
|
||||
)
|
||||
from .tree_node import TreeNode, list_to_tree, tree_to_list, get_tree_node
|
||||
from .tree_node import TreeNode, list_to_tree, tree_to_list
|
||||
from .vertex import Vertex, vals_to_vets, vets_to_vals
|
||||
from .print_util import (
|
||||
print_matrix,
|
||||
|
||||
@ -67,14 +67,3 @@ def tree_to_list(root: TreeNode | None) -> list[int]:
|
||||
res = []
|
||||
tree_to_list_dfs(root, 0, res)
|
||||
return res
|
||||
|
||||
|
||||
def get_tree_node(root: TreeNode | None, val: int) -> TreeNode | None:
|
||||
"""Get a tree node with specific value in a binary tree"""
|
||||
if not root:
|
||||
return
|
||||
if root.val == val:
|
||||
return root
|
||||
left: TreeNode | None = get_tree_node(root.left, val)
|
||||
right: TreeNode | None = get_tree_node(root.right, val)
|
||||
return left if left else right
|
||||
|
||||
Reference in New Issue
Block a user