mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
3e1cb70abf
* add algorithm to check binary search tree * add tests * add leetcode link * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * fix typehints * typehints fixes * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update data_structures/binary_tree/is_bst.py Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com> * Update data_structures/binary_tree/is_bst.py Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com> * Update data_structures/binary_tree/is_bst.py Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * fix flake8 * fix typehint * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * add TreeNode resolving * Update data_structures/binary_tree/is_bst.py Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com> * Update data_structures/binary_tree/is_bst.py Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com> * Update data_structures/binary_tree/is_bst.py Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com> * Update data_structures/binary_tree/is_bst.py Co-authored-by: Christian Clauss <cclauss@me.com> * change func name * Update data_structures/binary_tree/is_bst.py Co-authored-by: Christian Clauss <cclauss@me.com> * review notes fixes. * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * fix flake8 * fix flake 8 * fix doctest * Update data_structures/binary_tree/is_bst.py Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Caeden Perelli-Harris <caedenperelliharris@gmail.com> Co-authored-by: Christian Clauss <cclauss@me.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_node_sum.py | ||
binary_tree_path_sum.py | ||
binary_tree_traversals.md | ||
binary_tree_traversals.py | ||
diff_views_of_binary_tree.py | ||
fenwick_tree.py | ||
inorder_tree_traversal_2022.py | ||
is_bst.py | ||
lazy_segment_tree.py | ||
lowest_common_ancestor.py | ||
maximum_fenwick_tree.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 |