| 6 | self.right = right |
| 7 | |
| 8 | def addHelper(self,root,data): |
| 9 | |
| 10 | # case for reaching current leafs, base cases |
| 11 | if root.val < data and root.right == None: |
| 12 | root.right = BST(data,None,None) |
| 13 | return "insertion completed" |
| 14 | elif root.val > data and root.left == None: |
| 15 | root.left = BST(data,None,None) |
| 16 | return "insertion completed" |
| 17 | |
| 18 | # else we continue tracing downwards |
| 19 | if root.val < data: |
| 20 | return self.add(root.right,data) |
| 21 | elif root.val > data: |
| 22 | return self.add(root.left,data) |
| 23 | else: |
| 24 | return "insertion failed: duplicate value" |
| 25 | |
| 26 | def add(self,root,data): |
| 27 | if root == None: |