mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-05-23 00:41:19 -04:00
Change the dir structure slightly
This commit is contained in:
parent
6b6fe21db3
commit
2f4a9638c0
184 changed files with 0 additions and 21 deletions
23
source_code/trees/check_largest_item.py
Executable file
23
source_code/trees/check_largest_item.py
Executable file
|
@ -0,0 +1,23 @@
|
|||
#!/usr/bin/env python
|
||||
|
||||
__author__ = "bt3"
|
||||
|
||||
|
||||
from binary_search_tree import BST, Node
|
||||
|
||||
def largest(node):
|
||||
|
||||
if node.right:
|
||||
return largest(node.right)
|
||||
return node.item
|
||||
|
||||
|
||||
if __name__ == '__main__':
|
||||
|
||||
|
||||
bst = BST()
|
||||
l = [10, 5, 6, 3, 8, 2, 1, 11, 9, 4]
|
||||
for i in l:
|
||||
bst.add(i)
|
||||
|
||||
print(largest(bst.root))
|
Loading…
Add table
Add a link
Reference in a new issue