(self, newNode)
| 5 | self.rightChild = None |
| 6 | |
| 7 | def insertLeft(self, newNode): |
| 8 | if self.leftChild == None: |
| 9 | self.leftChild = BinaryTree(newNode) |
| 10 | else: |
| 11 | t = BinaryTree(newNode) |
| 12 | t.leftChild = self.leftChild |
| 13 | self.leftChild = t |
| 14 | |
| 15 | def insertRight(self, newNode): |
| 16 | if self.rightChild == None: |
no test coverage detected