mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-05-02 06:46:18 -04:00
Add trees, binary trees, bst, transversals (#34)
This commit is contained in:
parent
5af08f7498
commit
f3ee2cdf52
5 changed files with 303 additions and 4 deletions
|
@ -19,7 +19,7 @@ class Node(object):
|
|||
new_node = Node(value)
|
||||
|
||||
if not self.item:
|
||||
self.item = new_node
|
||||
self.item = new_node.value
|
||||
|
||||
else:
|
||||
if value > self.item:
|
||||
|
|
|
@ -37,7 +37,7 @@ def isBST_other_method(node, max_node=None, min_node=None):
|
|||
|
||||
if node.right:
|
||||
if node.right.item < node.item or node.right.item < min_node:
|
||||
rihjt = False
|
||||
right = False
|
||||
else:
|
||||
min_node = node.item
|
||||
right = isBST(node.right, max_node, min_node)
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue