algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 17:34:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixes unused variable errors in LGTM (#1746)

Browse Source 
* Fixes unsed variable errors in LGTM

* Fixes integer check

* Fixes failing tests
This commit is contained in:
onlinejudge95
2020-02-11 13:59:09 +05:30
committed by GitHub
parent fde31c93a3
commit 7b7c1a0135
6 changed files with 25 additions and 39 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
data_structures/binary_tree/binary_search_tree.py
View File

@ -76,7 +76,7 @@ class BinarySearchTree:
def search(self, value):
if self.empty():
raise IndexError("Warning: Tree is empty! please use another. ")
raise IndexError("Warning: Tree is empty! please use another.")
else:
node = self.root
# use lazy evaluation here to avoid NoneType Attribute error
@ -112,7 +112,6 @@ class BinarySearchTree:
if node is not None:
if node.left is None and node.right is None: # If it has no children
self.__reassign_nodes(node, None)
node = None
elif node.left is None: # Has only right children
self.__reassign_nodes(node, node.right)
elif node.right is None: # Has only left children
@ -154,7 +153,7 @@ def postorder(curr_node):
def binary_search_tree():
r"""
"""
Example
8
/ \
@ -164,15 +163,15 @@ def binary_search_tree():
/ \ /
4 7 13
>>> t = BinarySearchTree().insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
...
IndexError: Warning: Tree is empty! please use another.
>>> t = BinarySearchTree().insert(8, 3, 6, 1, 10, 14, 13, 4, 7)
>>> print(" ".join(repr(i.value) for i in t.traversal_tree()))
8 3 1 6 4 7 10 14 13
>>> print(" ".join(repr(i.value) for i in t.traversal_tree(postorder)))
1 4 7 6 3 13 14 10 8
>>> BinarySearchTree().search(6)
Traceback (most recent call last):
...
IndexError: Warning: Tree is empty! please use another.
"""
testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
t = BinarySearchTree()
@ -201,10 +200,8 @@ def binary_search_tree():
print(t)
二叉搜索树 = binary_search_tree
if __name__ == "__main__":
import doctest
doctest.testmod()
binary_search_tree()
# binary_search_tree()