mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
bf6db32ec2
* [mypy] Fix type annotations for binary tree traversals in data structures * Change variable name and update level_order_1 to use a deque Using a deque instead of a list here, because since we are removing from the beginning of the list, the deque will be more efficient. * remove duplicate function * Update data_structures/binary_tree/binary_tree_traversals.py Co-authored-by: John Law <johnlaw.po@gmail.com> * fix function name at line 137 * Update data_structures/binary_tree/binary_tree_traversals.py Co-authored-by: John Law <johnlaw.po@gmail.com> * Update data_structures/binary_tree/binary_tree_traversals.py Co-authored-by: John Law <johnlaw.po@gmail.com> * Remove type alias and use the new syntax * Update data_structures/binary_tree/binary_tree_traversals.py Co-authored-by: John Law <johnlaw.po@gmail.com> * Remove prints inside functions and return lists Co-authored-by: John Law <johnlaw.po@gmail.com> |
||
---|---|---|
.. | ||
__init__.py | ||
avl_tree.py | ||
basic_binary_tree.py | ||
binary_search_tree_recursive.py | ||
binary_search_tree.py | ||
binary_tree_mirror.py | ||
binary_tree_traversals.py | ||
fenwick_tree.py | ||
lazy_segment_tree.py | ||
lowest_common_ancestor.py | ||
merge_two_binary_trees.py | ||
non_recursive_segment_tree.py | ||
number_of_possible_binary_trees.py | ||
red_black_tree.py | ||
segment_tree_other.py | ||
segment_tree.py | ||
treap.py | ||
wavelet_tree.py |