def runBST(arr):
start = millis()
bst = BST()
bst.insertList(arr)
print("BST to list: \n" + str(bst.toList()))
end = millis()
print("time spent: " + str(round(end - start, 4)) + " ms\n")
node.count -= 1
return node
else:
if node.left is None:
temp = node.right
node = None
return temp
elif node.right is None:
temp = node.left
node = None
return temp
temp = self.findMin(node.right)
node.data = temp.data
node.count = temp.count
node.right = self.realRemove(node.right,temp.data)
return node
def findMin(self, node):
if node.left is None:
return node
else:
return self.findMin(node.left)
from BST import BST
bst = BST()
bst.insertList([6,7,4,32,54,67,8,5,4,3,5,4,3])
bst.toList()
