Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-30 04:36:08 -04:00
Code Issues Packages Projects Releases Wiki Activity

rename files to easily grouping

Browse Source
This commit is contained in:
Mari Wahl 2015-01-07 14:07:47 -05:00
parent 52752fb931
commit 5161f9d08a
6 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

0
src/builtin_structures/find_if_is_substr.py → src/builtin_structures/find_if_substr.py
View File

0
src/builtin_structures/longest_common_prefix.py → src/builtin_structures/find_longest_common_prefix.py
View File

0
src/builtin_structures/find_long_con_inc_subseq.py → src/builtin_structures/find_longest_inc_subseq.py
View File

0
src/builtin_structures/alpha_permutation.py → src/builtin_structures/permutations_alphanumeric.py
View File

0
src/builtin_structures/generate_prime.py → src/builtin_structures/primes_generating.py
View File

3
src/trees/binary_tree.py
View File

@ -26,6 +26,7 @@ class Node(object):
self.right = new_node self.right = new_node
else: else:
self.left = self.left._add(value) self.left = self.left._add(value)
return self return self
@ -33,7 +34,7 @@ class Node(object):
if self.item == value: if self.item == value:
return True # or self return True # or self
found = False # or False, thats diff from BST found = False # or None, thats diff from BST
if self.left: if self.left:
found = self.left._search(value) found = self.left._search(value)