(self, key, value, lc, rc)
| 32 | return self.rightChild and self.leftChild |
| 33 | |
| 34 | def replaceNodeData(self, key, value, lc, rc): |
| 35 | self.key = key |
| 36 | self.payload = value |
| 37 | self.leftChild = lc |
| 38 | self.rightChild = rc |
| 39 | if self.hasLeftChild(): |
| 40 | self.leftChild.parent = self |
| 41 | if self.hasRightChild(): |
| 42 | self.rightChild.parent = self |
| 43 | |
| 44 | class BinarySearchTree: |
| 45 | def __init__(self): |
no test coverage detected