TheAlgorithms/Python
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

Fixes black failures from Previous PR (#1751)

Browse Source 
* Fixes black failures from Previous PR

* Fixes equality testing alert

* Fixes call to main() alert

* Fixes unused import
This commit is contained in:
onlinejudge95
2020-02-13 02:19:41 +05:30
committed by GitHub
parent f0dfc4f46d
commit 4866b1330b
6 changed files with 9 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
data_structures/binary_tree/binary_search_tree.py
View File

@@ -56,13 +56,13 @@ class BinarySearchTree:
parent_node = self.root # from root
while True: # While we don't get to a leaf
if value < parent_node.value: # We go left
if parent_node.left == None:
if parent_node.left is None:
parent_node.left = new_node # We insert the new node in a leaf
break
else:
parent_node = parent_node.left
else:
if parent_node.right == None:
if parent_node.right is None:
parent_node.right = new_node
break
else: