(temp,data)
| 4 | self.left = left |
| 5 | self.right = right |
| 6 | def insert(temp,data): |
| 7 | que = [] |
| 8 | que.append(temp) |
| 9 | while (len(que)): |
| 10 | temp = que[0] |
| 11 | que.pop(0) |
| 12 | if (not temp.left): |
| 13 | if data is not None: |
| 14 | temp.left = TreeNode(data) |
| 15 | else: |
| 16 | temp.left = TreeNode(0) |
| 17 | break |
| 18 | else: |
| 19 | que.append(temp.left) |
| 20 | if (not temp.right): |
| 21 | if data is not None: |
| 22 | temp.right = TreeNode(data) |
| 23 | else: |
| 24 | temp.right = TreeNode(0) |
| 25 | break |
| 26 | else: |
| 27 | que.append(temp.right) |
| 28 | def make_tree(elements): |
| 29 | Tree = TreeNode(elements[0]) |
| 30 | for element in elements[1:]: |