(self)
| 223 | return succ |
| 224 | |
| 225 | def findMin(self): |
| 226 | current = self |
| 227 | while current.hasLeftChild(): |
| 228 | current = current.leftChild |
| 229 | return current |
| 230 | |
| 231 | def remove(self, currentNode): |
| 232 | if currentNode.isLeaf(): # leaf |
no test coverage detected