| 1 | class node(): |
| 2 | # BST data structure |
| 3 | def __init__(self, val): |
| 4 | self.val = val |
| 5 | self.left = None |
| 6 | self.right = None |
| 7 | |
| 8 | def insert(self,val): |
| 9 | if self.val: |
| 10 | if val < self.val: |
| 11 | if self.left is None: |
| 12 | self.left = node(val) |
| 13 | else: |
| 14 | self.left.insert(val) |
| 15 | elif val > self.val: |
| 16 | if self.right is None: |
| 17 | self.right = node(val) |
| 18 | else: |
| 19 | self.right.insert(val) |
| 20 | else: |
| 21 | self.val = val |
| 22 | |
| 23 | def inorder(root, res): |
| 24 | # Recursive travesal |