class BSTTableWrapper: def __init__(self): self.bst = BinarySearchTree() def tableInsert(self, newItem): return self.bst.searchTreeInsert(newItem) def tableDelete(self, searchKey): return self.bst.searchTreeDelete(searchKey) def tableRetrieve(self, searchKey): return self.bst.searchTreeRetrieve(searchKey) def tableIsEmpty(self): return self.bst.isEmpty() def tableTraverse(self): return self.bst.inorderTraverse()
class BSTTable: # Wrapper with table operations for BinarySearchTree def __init__(self): self.bst = BinarySearchTree() def __del__(self): self.bst = None def isEmpty(self): return self.bst.isEmpty() def getLength(self): return self.bst.getTreeLength() def tableInsert(self, order): return self.bst.searchTreeInsert(TreeItem(order, order.getTimestamp())) def tableDelete(self, timestamp): return self.bst.searchTreeDelete(timestamp) def traverseTable(self): return self.bst.inorderTraverse()
print() # 20 if (currentWerknemer2.workload - (2 * currentWerknemer2.currentBestelling.credits)) <= 0: print("20-21: De werknemer is klaar.") currentWerknemer2.currentBestelling = None stack1.push(currentWerknemer1) print("De werknemer (nr.2 van de stack) gaat terug op de stack.") bestelling_Tree.searchTreeInsert(currentBestelling2) print("Bestelling 2 werd toegevoegd aan de binaire zoekboom.") else: print("20-21: De werknemer (nr.2 van de stack) is nog niet klaar.") print() #EXTRA print("Inorder Traversal van de reeds gemaakte binaire boom:") bestelling_Tree.inorderTraverse() print() V = Werknemer(3, "Tibo", "yeet", 8) chain1.insert(2, V) print(chain1.retrieve(0)[0].value) print(chain1.retrieve(1)[0].value) print(chain1.retrieve(2)[0].value) chain1.sort() print() print(chain1.retrieve(0)[0].value) print(chain1.retrieve(1)[0].value) print(chain1.retrieve(2)[0].value)