(self, val, to_delete=False)
| 47 | break |
| 48 | |
| 49 | def search(self, val, to_delete=False): |
| 50 | current = self.root |
| 51 | prev = -1 |
| 52 | while current: |
| 53 | if val < current.info: |
| 54 | prev = current |
| 55 | current = current.left |
| 56 | elif val > current.info: |
| 57 | prev = current |
| 58 | current = current.right |
| 59 | elif current.info == val: |
| 60 | if not to_delete: |
| 61 | return "Match Found" |
| 62 | return prev |
| 63 | else: |
| 64 | break |
| 65 | if not to_delete: |
| 66 | return "Not Found" |
| 67 | |
| 68 | # Method to delete a tree-node if it exists, else error message will be returned. |
| 69 | def delete(self, val): |
no outgoing calls
no test coverage detected