mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-05-25 09:50:59 -04:00
fix few details, transversals
This commit is contained in:
parent
f77b8eaaf2
commit
1af8145904
13 changed files with 227 additions and 963 deletions
|
@ -115,7 +115,7 @@ class NodeBT(object):
|
|||
else:
|
||||
return False
|
||||
else:
|
||||
raise Exception('Tree is empty')
|
||||
print('Tree is empty')
|
||||
|
||||
|
||||
|
||||
|
@ -136,14 +136,17 @@ class BinaryTree(object):
|
|||
|
||||
def isLeaf(self, value):
|
||||
node = self.root._searchForNode(value)
|
||||
return node._isLeaf()
|
||||
if node:
|
||||
return node._isLeaf()
|
||||
else:
|
||||
print "Node not found."
|
||||
|
||||
def getNodeLevel(self, item):
|
||||
node = self.root._searchForNode(item)
|
||||
if node:
|
||||
return node.level
|
||||
else:
|
||||
raise Exception('Node not found')
|
||||
print('Node not found')
|
||||
|
||||
def isRoot(self, value):
|
||||
return self.root.item == value
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue