(self, key, val)
| 56 | return self.root.__iter__() |
| 57 | |
| 58 | def put(self, key, val): |
| 59 | if self.root: |
| 60 | self._put(key, val, self.root) |
| 61 | else: |
| 62 | self.root = TreeNode(key, val) |
| 63 | self.size = self.size + 1 |
| 64 | |
| 65 | def _put(self, key, val, currentNode): |
| 66 | if key < currentNode.key: |
no test coverage detected