-
Notifications
You must be signed in to change notification settings - Fork 0
/
treeNodeClass.py
56 lines (46 loc) · 1.49 KB
/
treeNodeClass.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
import time # to be able to add delays between prints
class node(object):
val = None # value of node
refL = None # right node if >
refR = None # left node if =<
def __init__(self,val):
self.val = val
def branch(self,newVal):
if newVal > self.val:
if self.refR == None:
self.refR = node(newVal)
else:
self.refR.branch(newVal)
elif newVal <= self.val:
if self.refL == None:
self.refL = node(newVal)
else:
self.refL.branch(newVal)
def getPrintOut(self,currNode,level=1):
# get current node
output = str(currNode.val)
# get left node or its branches
if currNode.refL != None:
output += str(self.getPrintOut(currNode.refL,level+1))
# get right node or its branches
if currNode.refR != None:
output += "\n" + " "*level + str(self.getPrintOut(currNode.refR,level+1))
return output
print("\ntree node Branching and Printout example")
print("")
print("")
time.sleep(2)
print("\n\"BRANCH\" = Larger number ; \"GROWTH\" = Smaller or Equal number\n")
time.sleep(3)
tree = node(1)
nodesToAdd = [5,3,7,2,4,6,0,9,8]
print('nodesToAdd = ', nodesToAdd, '\n')
time.sleep(1)
for currNode in nodesToAdd:
# print tree so far
print(tree.getPrintOut(tree))
# add new line for final output
print()
# add branch to tree
tree.branch(currNode)
time.sleep(1)