algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-06 10:31:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

[mypy] Fix type annotations in data_structures/binary_tree (#5518)

Browse Source 
* fix: fix mypy errors

Update binary_search_tree `arr` argument to be typed as a list
within `find_kth_smallest` function

Update return type of `merge_two_binary_trees` as both inputs can
be None which means that a None type value can be returned from
this function

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Sherman Hui
2021-10-22 07:07:05 -07:00
committed by GitHub
parent d82cf5292f
commit 629848e372
3 changed files with 5 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
data_structures/binary_tree/merge_two_binary_trees.py
View File

@ -7,6 +7,8 @@ will be used as the node of new tree.
"""
from __future__ import annotations
from typing import Optional
class Node:
"""
@ -19,7 +21,7 @@ class Node:
self.right: Node | None = None
def merge_two_binary_trees(tree1: Node | None, tree2: Node | None) -> Node:
def merge_two_binary_trees(tree1: Node | None, tree2: Node | None) -> Optional[Node]:
"""
Returns root node of the merged tree.